LEADER 05957nam 22007815 450 001 9910767511003321 005 20230222133507.0 010 $a3-540-85780-X 024 7 $a10.1007/978-3-540-85780-8 035 $a(CKB)1000000000490502 035 $a(SSID)ssj0000317187 035 $a(PQKBManifestationID)11232419 035 $a(PQKBTitleCode)TC0000317187 035 $a(PQKBWorkID)10292622 035 $a(PQKB)11648681 035 $a(DE-He213)978-3-540-85780-8 035 $a(MiAaPQ)EBC3063472 035 $a(MiAaPQ)EBC6426737 035 $a(PPN)129062588 035 $a(EXLCZ)991000000000490502 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory $e12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings /$fedited by Masami Ito, Masafumi Toyama 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 544 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5257 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-85779-6 320 $aIncludes bibliographical references and author index. 327 $aInvited Talks -- Iteration Semirings -- Various Aspects of Finite Quantum Automata -- On the Hardness of Determining Small NFA?s and of Proving Lower Bounds on Their Sizes -- Selected Ideas Used for Decidability and Undecidability of Bisimilarity -- The Frobenius Problem and Its Generalizations -- Well Quasi-orders in Formal Language Theory -- Contributed Papers -- On the Non-deterministic Communication Complexity of Regular Languages -- General Algorithms for Testing the Ambiguity of Finite Automata -- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete -- The Average State Complexity of the Star of a Finite Set of Words Is Linear -- On the Computational Capacity of Parallel Communicating Finite Automata -- On a Generalization of Standard Episturmian Morphisms -- Universal Recursively Enumerable Sets of Strings -- Algorithmically Independent Sequences -- Relationally Periodic Sequences and Subword Complexity -- Bounds on Powers in Strings -- When Is Reachability Intrinsically Decidable? -- Some New Modes of Competence-Based Derivations in CD Grammar Systems -- The Synchronization Problem for Strongly Transitive Automata -- On the Decidability of the Equivalence for k-Valued Transducers -- Decidable Properties of 2D Cellular Automata -- Fixed Point and Aperiodic Tilings -- Extended Multi Bottom-Up Tree Transducers -- Derivation Tree Analysis for Accelerated Fixed-Point Computation -- Tree Automata with Global Constraints -- Bad News on Decision Problems for Patterns -- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time -- More Concise Representation of Regular Languages by Automata and Regular Expressions -- A Taxonomy of Deterministic Forgetting Automata -- Provably Shorter Regular Expressions from Deterministic Finite Automata -- Large Simple Binary Equality Words -- On the Relation between Periodicity and Unbordered Factors of Finite Words -- Duplication in DNA Sequences -- On the State Complexity of Complements, Stars, and Reversals of Regular Languages -- On the State Complexity of Operations on Two-Way Finite Automata -- On the Size Complexity of Rotating and Sweeping Automata -- An Analysis and a Reproof of Hmelevskii?s Theorem -- Hierarchies of Piecewise Testable Languages -- Construction of Tree Automata from Regular Expressions -- Balance Properties and Distribution of Squares in Circular Words -- MSO Logic for Unambiguous Shared-Memory Systems -- Complexity of Topological Properties of Regular ?-Languages. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including 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; quantum computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5257 606 $aMachine theory 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aFormal Languages and Automata Theory 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 615 0$aMachine theory. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 676 $a004 702 $aIto?$b Masami$f1941- 702 $aToyama$b Masafumi 712 12$aConference on Developments in Language Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767511003321 996 $aDevelopments in Language Theory$9772277 997 $aUNINA