UID:
almahu_9948352075802882
Format:
X, 333 p. 271 illus., 5 illus. in color.
,
online resource.
Edition:
1st ed. 2020.
ISBN:
9783030485160
Series Statement:
Theoretical Computer Science and General Issues ; 12086
Content:
This book constitutes the proceedings of the 24th International Conference on Developments in Language Theory, DLT 2020, which was due to be held in Tampa, Florida, USA, in May 2020. The conference was cancelled due to the COVID-19 pandemic. The 24 full papers presented were carefully reviewed and selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related areas, such as algorithmic, combinatorial, and algebraic properties of words and languages, cellular automata, algorithms on words, etc.
Note:
Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson's Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoffel Tree According to a Second-order Balancedness.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783030485153
Additional Edition:
Printed edition: ISBN 9783030485177
Language:
English
DOI:
10.1007/978-3-030-48516-0
URL:
https://doi.org/10.1007/978-3-030-48516-0
