Del 13918 i serien Lecture Notes in Computer Science

Descriptional Complexity of Formal Systems

25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings

Häftad, Engelska, 2023

AvHenning Bordihn,Nicholas Tran,György Vaszil

879 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023.The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

Produktinformation

Utgivningsdatum2023-05-30
Mått155 x 235 x 12 mm
Vikt335 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor197
Upplaga23001
FörlagSpringer International Publishing AG
ISBN9783031343254

Tillhör följande kategorier

Hårdvara inom Data och IT
Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Operational State Complexity Revisited: the Contribution of Monsters and Modifiers.- Hypercubes and Isometric Words based on Swap and Mismatch Distance.- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.- Existential and Universal Width of Alternating Finite Automata.- On Jaffe’s Pumping Lemma, Revisited .- Operational Complexity: NFA-to-DFA Trade-Off.- The Word Problem for Finitary Automaton Groups.- Separating Words Problem over Groups.- Complexity of Exclusive Nondeterministic Finite Automata.- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound.- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage.- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter.- Merging two Hierarchies of External Contextual Grammars with Subregular Selection.- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.