LEADER 05291nam 22007335 450 001 996466431403316 005 20230222010208.0 010 $a3-642-14455-1 024 7 $a10.1007/978-3-642-14455-4 035 $a(CKB)2670000000036332 035 $a(SSID)ssj0000446419 035 $a(PQKBManifestationID)11318354 035 $a(PQKBTitleCode)TC0000446419 035 $a(PQKBWorkID)10495816 035 $a(PQKB)10772608 035 $a(DE-He213)978-3-642-14455-4 035 $a(MiAaPQ)EBC3065650 035 $a(PPN)149018037 035 $a(EXLCZ)992670000000036332 100 $a20100814d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings /$fedited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 446 p. 48 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6224 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14454-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D?Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?ernı-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant?s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?ernı Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6224 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aProgramming Techniques 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 14$aProgramming Techniques. 615 24$aCompilers and Interpreters. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 676 $a005.11 702 $aGao$b Yuan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLu$b Hanlin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSeki$b Shinnosuke$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aYu$b Sheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466431403316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA