LEADER 05022nam 22007455 450 001 996204727703316 005 20230330030300.0 010 $a3-319-21500-0 024 7 $a10.1007/978-3-319-21500-6 035 $a(CKB)3710000000454196 035 $a(SSID)ssj0001558493 035 $a(PQKBManifestationID)16182674 035 $a(PQKBTitleCode)TC0001558493 035 $a(PQKBWorkID)14819336 035 $a(PQKB)11291744 035 $a(DE-He213)978-3-319-21500-6 035 $a(MiAaPQ)EBC6283881 035 $a(MiAaPQ)EBC5596187 035 $a(Au-PeEL)EBL5596187 035 $a(OCoLC)914300481 035 $a(PPN)18768880X 035 $a(EXLCZ)993710000000454196 100 $a20150717d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. /$fedited by Igor Potapov 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XXI, 440 p. 71 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9168 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-21499-3 327 $aRecognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation. 330 $aThis book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9168 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004 702 $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996204727703316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA