Cantitate/Preț
Produs
Total produse
Vezi coșul
Developments in Language Theory: 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings de Nataša Jonoska

Developments in Language Theory: 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12086

Editat de Nataša Jonoska, Dmytro Savchuk
en Limba Engleză Paperback – 15 mai 2020
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32798 lei

Preț vechi: 40997 lei
-20% Nou

Puncte Express: 492
Preț estimativ în valută:
6277€ • 6520$ • 5214£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030485153
ISBN-10: 3030485153
Pagini: 300
Ilustrații: X, 333 p. 271 illus., 5 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.48 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.