Format:
1 Online-Ressource(XXVIII, 213 p. 47 illus., 1 illus. in color.)
Edition:
1st ed. 2022.
ISBN:
9783031132575
Series Statement:
Lecture Notes in Computer Science 13439
Content:
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.
Content:
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.
Additional Edition:
ISBN 9783031132568
Additional Edition:
ISBN 9783031132582
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783031132568
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783031132582
Language:
English
DOI:
10.1007/978-3-031-13257-5
