Del 12086 i serien Lecture Notes in Computer Science

Developments in Language Theory

24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings

Häftad, Engelska, 2020

729 kr

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

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.

Produktinformation

Utgivningsdatum2020-05-15
Mått155 x 235 x 19 mm
Vikt522 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor333
FörlagSpringer Nature Switzerland AG
ISBN9783030485153

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

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 Christoﬀel Tree According to a Second-order Balancedness.