Descriptional Complexity of Formal Systems -

Descriptional Complexity of Formal Systems

24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings

Yo-Sub Han, György Vaszil (Herausgeber)

Buch | Softcover
XXVIII, 213 Seiten
2022 | 1st ed. 2022
Springer International Publishing (Verlag)
978-3-031-13256-8 (ISBN)
80,24 inkl. MwSt
This book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022.
The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.


The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages.- Ranking Binary Unlabelled Necklaces in Polynomial Time.- On the Power of Recursive Word-Functions without Concatenation.- Clusters of Repetition Roots Forming Prefix Chains.- Nearly k-Universal Words - Investigating a Part of Simon's Congruence.- State Complexity of Binary Coded Regular Languages.- Reset Complexity and Completely Reachable Automata with Simple Idempotents.- On the Descriptional Complexity of the Direct Product of Finite Automata.- Operations on Subregular Languages and Nondeterministic State Complexity.- On Simon's Congruence Closure of a String.- Approximate NFA Universality Motivated by Information Theory.- Lazy Regular Sensing.- State Complexity of Finite Partial Languages.- Yet Another Canonical Nondeterministic Automaton.- Union-Complexities of Kleene Plus Operation.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XXVIII, 213 p. 47 illus., 1 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 379 g
Themenwelt Mathematik / Informatik Informatik Netzwerke
Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Informatik Weitere Themen Hardware
Schlagworte Applications • Artificial Intelligence • Automata • Automata Theory • Automation • Computational Linguistics • Computer Science • Computer systems • conference proceedings • context free languages • Finite Automata • Formal Languages • Informatics • Query Languages • regular languages • Research • Signal Processing • theoretical computer science
ISBN-10 3-031-13256-4 / 3031132564
ISBN-13 978-3-031-13256-8 / 9783031132568
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Eine kurze Geschichte der Informationsnetzwerke von der Steinzeit bis …

von Yuval Noah Harari

Buch | Hardcover (2024)
Penguin (Verlag)
28,00