000 04522nam a22006015i 4500
001 978-3-030-48516-0
003 DE-He213
005 20240423125215.0
007 cr nn 008mamaa
008 200514s2020 sz | s |||| 0|eng d
020 _a9783030485160
_9978-3-030-48516-0
024 7 _a10.1007/978-3-030-48516-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /
_cedited by Nataša Jonoska, Dmytro Savchuk.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aX, 333 p. 271 illus., 5 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12086
505 0 _aEquational 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aNatural language processing (Computer science).
650 0 _aComputer science
_xMathematics.
650 0 _aComputer networks .
650 0 _aLogic programming.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aNatural Language Processing (NLP).
650 2 4 _aMathematics of Computing.
650 2 4 _aComputer Communication Networks.
650 2 4 _aLogic in AI.
700 1 _aJonoska, Nataša.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSavchuk, Dmytro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030485153
776 0 8 _iPrinted edition:
_z9783030485177
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12086
856 4 0 _uhttps://doi.org/10.1007/978-3-030-48516-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175424
_d175424