04934nam 22007815 450 99646611620331620230221160158.03-540-73208-X10.1007/978-3-540-73208-2(CKB)1000000000490503(SSID)ssj0000317186(PQKBManifestationID)11222219(PQKBTitleCode)TC0000317186(PQKBWorkID)10294279(PQKB)11246518(DE-He213)978-3-540-73208-2(MiAaPQ)EBC3063321(MiAaPQ)EBC6711199(Au-PeEL)EBL6711199(OCoLC)184905847(PPN)123163145(EXLCZ)99100000000049050320100301d2007 u| 0engurnn|008mamaatxtccrDevelopments in Language Theory[electronic resource] 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings /edited by Tero Harju, Juhani Karhumäki, Arto Lepistö1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XI, 428 p.) Theoretical Computer Science and General Issues,2512-2029 ;4588Bibliographic Level Mode of Issuance: Monograph3-540-73207-1 Includes bibliographical references and index.Invited Talks -- On First-Order Fragments for Words and Mazurkiewicz Traces -- Quantitative Generalizations of Languages -- What Do We Know About Language Equations? -- Information Distance and Applications -- Finite Automata and the Writing of Numbers -- Descriptional Complexity of Nondeterministic Finite Automata -- Contributed Papers -- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages -- Coding Partitions: Regularity, Maximality and Global Ambiguity -- Multi-letter Reversible and Quantum Finite Automata -- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids -- The Dynamics of Cellular Automata in Shift-Invariant Topologies -- Two Element Unavoidable Sets of Partial Words -- Hairpin Finite Automata -- Characterizing Reduction Graphs for Gene Assembly in Ciliates -- 2-Visibly Pushdown Automata -- An Efficient Computation of the Equation -Automaton of a Regular -Expression -- An Extension of Newton’s Method to ?-Continuous Semirings -- Non-constructive Methods for Finite Probabilistic Automata -- The Unambiguity of Segmented Morphisms -- Commutation of Binary Factorial Languages -- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP -- State Complexity of Union and Intersection of Finite Languages -- Bisimulation Minimisation for Weighted Tree Automata -- Conjunctive Grammars Can Generate Non-regular Unary Languages -- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet -- Reduced Languages as ?-Generators -- Avoiding Approximate Squares -- Duplication Roots -- Complexity Theory for Splicing Systems -- Descriptional Complexity of Bounded Context-Free Languages -- Definable Transductions and Weighted Logics for Texts -- A Star Operation for Star-Free Trace Languages -- Finite Automata on Unranked and Unordered DAGs -- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases -- A Local Balance Property of Episturmian Words -- Suffix Automata and Standard Sturmian Words -- Fine Hierarchy of Regular Aperiodic ?-Languages -- On Transition Minimality of Bideterministic Automata.Theoretical Computer Science and General Issues,2512-2029 ;4588Machine theoryComputer scienceComputer science—MathematicsDiscrete mathematicsFormal Languages and Automata TheoryTheory of ComputationComputer Science Logic and Foundations of ProgrammingDiscrete Mathematics in Computer ScienceSymbolic and Algebraic ManipulationMachine 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.Symbolic and Algebraic Manipulation.005.131Harju T.Karhumäki JuhaniLepistö ArtoConference on Developments in Language TheoryMiAaPQMiAaPQMiAaPQBOOK996466116203316Developments in Language Theory772277UNISA