LEADER 05455nam 22007575 450 001 996202532403316 005 20230329135809.0 010 $a3-319-09698-2 024 7 $a10.1007/978-3-319-09698-8 035 $a(CKB)3710000000227361 035 $a(SSID)ssj0001338687 035 $a(PQKBManifestationID)11776632 035 $a(PQKBTitleCode)TC0001338687 035 $a(PQKBWorkID)11344721 035 $a(PQKB)10673588 035 $a(DE-He213)978-3-319-09698-8 035 $a(MiAaPQ)EBC6301305 035 $a(MiAaPQ)EBC5588132 035 $a(Au-PeEL)EBL5588132 035 $a(OCoLC)889228977 035 $a(PPN)180625934 035 $a(EXLCZ)993710000000227361 100 $a20140818d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings /$fedited by Arseny M. Shur, Mikhail V. Volkov 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XVIII, 349 p. 51 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8633 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-09697-4 327 $aFinite Automata and Regular Languages On Automatic Transitive Graphs.-  Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals -- On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States -- State Complexity of Deletion -- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory -- On two Algorithmic Problems about Synchronizing Automata (short paper) -- Synchronizing Automata with Random Inputs (short paper) -- Graph Spectral Properties of Deterministic Finite Automata (short paper) -- Pushdown Automata and Related Models -- Input-Driven Pushdown Automata with Limited Nondeterminism (invited paper) -- How to Remove the Look-Ahead of Top-Down Tree Transducers -- Scope-Bounded Pushdown Languages -- Visibly Pushdown Transducers with Well-nested Outputs -- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing -- Pumping Lemma and Ogden Lemma for Displacement Context-free Grammars -- Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy -- On k-Abelian Pattern Matching -- On k-Abelian Palindromic Rich and Poor Words -- Variations of The Morse{Hedlund Theorem for k-Abelian Equivalence -- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word -- Knight Tiles: Particles and Collisions in The Realm of 4-Way Deterministic Tilings -- Eigenvalues and Transduction of Morphic Sequences -- Breadth-First Serialisation of Trees and Rational Languages (short paper) -- Algebraic, Decidability and Complexity Problems for Languages Measuring Communication in Automata Systems (invited paper) -- From Algebra to Logic: There and Back Again { The Story of A Hierarchy (invited paper) -- Closure Properties of Pattern Languages -- Minimal and Hyper-Minimal Biautomata -- Deterministic Set Automata -- The Minimum Amount of Useful Space: New Results and New Directions -- Debates with Small Transparent Quantum Verifiers -- Embedding Finite and Infinite Words into Overlapping Tiles. 330 $aThis book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Automata, Algorithmic, Combinatorial and Algebraic Properties of Words and Languages, Variable Length Codes, Symbolic Dynamics, Cellular Automata,  Polyominoes and Multidimensional Patterns,  Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic,  Bio-Inspired Computing, and Quantum Computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8633 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 $a511.3 702 $aShur$b Arseny M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVolkov$b Mikhail V$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996202532403316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA