Atjaunināt sīkdatņu piekrišanu

Developments in Language Theory: 24th International Conference, DLT 2020, Tampa, FL, USA, May 1115, 2020, Proceedings 2020 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 333 pages, height x width: 235x155 mm, weight: 528 g, 5 Illustrations, color; 266 Illustrations, black and white; X, 333 p. 271 illus., 5 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12086
  • Izdošanas datums: 15-May-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030485153
  • ISBN-13: 9783030485153
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 333 pages, height x width: 235x155 mm, weight: 528 g, 5 Illustrations, color; 266 Illustrations, black and white; X, 333 p. 271 illus., 5 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12086
  • Izdošanas datums: 15-May-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030485153
  • ISBN-13: 9783030485153
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.
Equational Theories of Scattered and Countable Series-parallel Posets.-
Scattered Factor-Universality of Words.- On Normalish Subgroups of the R.
Thompsons 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 Christoel Tree
According to a Second-order Balancedness.