000 05169nam a22005895i 4500
001 978-3-319-09698-8
003 DE-He213
005 20240730193646.0
007 cr nn 008mamaa
008 140818s2014 sz | s |||| 0|eng d
020 _a9783319096988
_9978-3-319-09698-8
024 7 _a10.1007/978-3-319-09698-8
_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] :
_b18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings /
_cedited by Arseny M. Shur, Mikhail V. Volkov.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXVIII, 349 p. 51 illus.
_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 ;
_v8633
505 0 _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 OverlappingTiles.
520 _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.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9154104
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aTheory of Computation.
_9154105
650 2 4 _aFormal Languages and Automata Theory.
_9154106
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aShur, Arseny M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9154107
700 1 _aVolkov, Mikhail V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9154108
710 2 _aSpringerLink (Online service)
_9154109
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319096971
776 0 8 _iPrinted edition:
_z9783319096995
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8633
_9154110
856 4 0 _uhttps://doi.org/10.1007/978-3-319-09698-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94810
_d94810