000 05025nam a22005415i 4500
001 978-3-642-38771-5
003 DE-He213
005 20200421111200.0
007 cr nn 008mamaa
008 130611s2013 gw | s |||| 0|eng d
020 _a9783642387715
_9978-3-642-38771-5
024 7 _a10.1007/978-3-642-38771-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b17th International Conference, DLT 2013, Marne-la-Vall�ee, France, June 18-21, 2013. Proceedings /
_cedited by Marie-Pierre B�eal, Olivier Carton.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXIV, 460 p. 46 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7907
505 0 _aUltrametric Finite Automata and Turing Machines -- Recompression: Word Equations and Beyond -- Joint Spectral Characteristics: A Tale of Three Disciplines -- Unambiguous Finite Automata -- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages -- Two Dimensional Prefix Codes of Pictures -- Adjacent Ordered Multi-Pushdown Systems -- Cuts in Regular Expressions -- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem -- On the Asymptotic Abelian Complexity of Morphic Words -- Strict Bounds for Pattern Avoidance -- A Fresh Approach to Learning Register Automata -- Suffixes, Conjugates and Lyndon Words -- Extremal Words in the Shift Orbit Closure of a Morphic Sequence -- Inner Palindromic Closure -- On the Dual Post Correspondence Problem -- Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata -- A Coloring Problem for Sturmian and Episturmian Words -- The Chomsky-Sch�utzenberger Theorem for Quantitative Context-Free Languages -- Operational Characterization of Scattered MCFLs -- Abelian Repetitions in Sturmian Words -- Composition Closure of (Sf(B-Free Linear Extended Top-Down Tree Transducers -- Subword Complexity and k-Synchronization -- Some Decision Questions Concerning the Time Complexity of Language Acceptors -- Unambiguous Conjunctive Grammars over a One-Letter Alphabet -- Alternative Automata Characterization of Piecewise Testable Languages -- Finite Automata with Advice Tapes -- One-Way Multi-Head Finite Automata with Pebbles But No States -- Regular Expressions with Binding over Data Words for Querying Graph Databases -- Factorizations and Universal Automaton of Omega Languages -- Deciding Determinism of Unary Languages Is coNP-Complete -- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure -- 3-Abelian Cubes Are Avoidable on Binary Alphabets -- Repetition Avoidance in Circular Factors -- Operator Precedence (S}(B-Languages -- New Results on Deterministic Sgraffito Automata -- On the Number of Abelian Bordered Words -- Proof of a Phase Transition in Probabilistic Cellular Automata -- Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.
520 _aThis book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vall�ee, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference 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.
650 0 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aB�eal, Marie-Pierre.
_eeditor.
700 1 _aCarton, Olivier.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642387708
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7907
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-38771-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53753
_d53753