04520nam 22006735 450 99646582840331620230405224721.010.1007/b137735(CKB)1000000000213088(SSID)ssj0000317189(PQKBManifestationID)11222220(PQKBTitleCode)TC0000317189(PQKBWorkID)10286455(PQKB)10924684(DE-He213)978-3-540-31682-4(MiAaPQ)EBC3068348(PPN)123095735(EXLCZ)99100000000021308820100926d2005 u| 0engurnn|008mamaatxtccrDevelopments in Language Theory[electronic resource] 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings /edited by Clelia De Felice, Antonio Restivo1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XII, 412 p.) Theoretical Computer Science and General Issues,2512-2029 ;3572"9th Conference on Developments in Language Theory ... held at Mondello (Palermo, Italy)"--Pref.Printed edition: 9783540265467 Includes bibliographical references and index.Restricted Towers of Hanoi and Morphisms -- Collapsing Words: A Progress Report -- Locally Consistent Parsing and Applications to Approximate String Comparisons -- Central Sturmian Words: Recent Developments -- Reversible Cellular Automata -- Inexpressibility Results for Regular Languages in Nonregular Settings -- Complexity of Quantum Uniform and Nonuniform Automata -- Membership and Finiteness Problems for Rational Sets of Regular Languages -- Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells -- The Mortality Threshold for Partially Monotonic Automata -- Sturmian Words: Dynamical Systems and Derivated Words -- Schützenberger and Eilenberg Theorems for Words on Linear Orderings -- On the Membership of Invertible Diagonal Matrices -- A Kleene Theorem for Languages of Words Indexed by Linear Orderings -- Revolving-Input Finite Automata -- Some New Results on Palindromic Factors of Billiard Words -- A Note on a Result of Daurat and Nivat -- Palindromes in Sturmian Words -- Voronoi Cells of Beta-Integers -- Languages with Mismatches and an Application to Approximate Indexing -- Bidimensional Sturmian Sequences and Substitutions -- Unambiguous Morphic Images of Strings -- Complementing Two-Way Finite Automata -- On Timed Automata with Discrete Time – Structural and Language Theoretical Characterization -- Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols -- On Hairpin-Free Words and Languages -- Adding Monotonic Counters to Automata and Transition Graphs -- Polynomial Generators of Recursively Enumerable Languages -- On Language Inequalities XK???LX -- The Power of Tree Series Transducers of Type I and II -- The Inclusion Problem for Unambiguous Rational Trace Languages -- LR Parsing for Boolean Grammars -- On Some Properties of the Language of 2-Collapsing Words -- Semi-rational Sets of DAGs -- On the Frequency of Letters in Pure Binary Morphic Sequences.Theoretical Computer Science and General Issues,2512-2029 ;3572Machine theoryComputer scienceComputer science—MathematicsDiscrete mathematicsFormal Languages and Automata TheoryTheory of ComputationComputer Science Logic and Foundations of ProgrammingDiscrete Mathematics in Computer ScienceMachine theory.Computer science.Computer science—Mathematics.Discrete mathematics.Formal Languages and Automata Theory.Theory of Computation.Computer Science Logic and Foundations of Programming.Discrete Mathematics in Computer Science.511.354.72bclDe Felice Cleliaedthttp://id.loc.gov/vocabulary/relators/edtRestivo Antonioedthttp://id.loc.gov/vocabulary/relators/edtConference on Developments in Language TheoryBOOK996465828403316Developments in Language Theory772277UNISA