Muutke küpsiste eelistusi

E-raamat: Developments in Language Theory: 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings

Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.