Descriptional Complexity of Formal Systems

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

Henning Bordihn, Nicholas Tran, György Vaszil (Herausgeber)

Buch | Softcover

XVI, 197 Seiten

2023 | 1st ed. 2023
Springer International Publishing (Verlag)
978-3-031-34325-4 (ISBN)

Artikel merken

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.

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.

Erscheinungsdatum	31.05.2023
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XVI, 197 p. 42 illus., 13 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	338 g
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
	Informatik ► Weitere Themen ► Hardware
Schlagworte	Algebraic Language Theory • Automata • combinatorics of words • contextual grammars • counter automata • descriptional complexity • distance of words • Finite Automata • finite transducers • Formal Languages • pushdown automata • regular languages • State Complexity • Structural Complexity • theoretical computer science
ISBN-10	3-031-34325-5 / 3031343255
ISBN-13	978-3-031-34325-4 / 9783031343254
Zustand	Neuware