LEADER 05933nam 22008055 450 001 996465588803316 005 20230222090804.0 010 $a3-540-88282-0 024 7 $a10.1007/978-3-540-88282-4 035 $a(CKB)1000000000490748 035 $a(SSID)ssj0000318610 035 $a(PQKBManifestationID)11222358 035 $a(PQKBTitleCode)TC0000318610 035 $a(PQKBWorkID)10311010 035 $a(PQKB)10308016 035 $a(DE-He213)978-3-540-88282-4 035 $a(MiAaPQ)EBC3063367 035 $a(MiAaPQ)EBC6386337 035 $a(PPN)129063266 035 $a(EXLCZ)991000000000490748 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLanguage and Automata Theory and Applications$b[electronic resource] $eSecond International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers /$fedited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIV, 500 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5196 300 $aIncludes index. 311 $a3-540-88281-2 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Tree-Walking Automata -- Formal Language Tools for Template-Guided DNA Recombination -- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg -- Synchronizing Automata and the ?ern Conjecture -- Contributed Papers -- About Universal Hybrid Networks of Evolutionary Processors of Small Size -- On Bifix Systems and Generalizations -- Finite Automata, Palindromes, Powers, and Patterns -- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations -- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions -- Optional and Iterated Types for Pregroup Grammars -- Transformations and Preservation of Self-assembly Dynamics through Homotheties -- Deterministic Input-Reversal and Input-Revolving Finite Automata -- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems -- Extending the Overlap Graph for Gene Assembly in Ciliates -- Automatic Presentations for Cancellative Semigroups -- Induced Subshifts and Cellular Automata -- Hopcroft?s Algorithm and Cyclic Automata -- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs -- Consensual Definition of Languages by Regular Sets -- k-Petri Net Controlled Grammars -- 2-Synchronizing Words -- Not So Many Runs in Strings -- A Hybrid Approach to Word Segmentation of Vietnamese Texts -- On Linear Logic Planning and Concurrency -- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) -- Anti-pattern Matching Modulo -- Counting Ordered Patterns in Words Generated by Morphisms -- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups -- Characterization of Star-Connected Languages Using Finite Automata -- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems -- Further Results on Insertion-Deletion Systems with One-Sided Contexts -- On Regularity-Preservation by String-Rewriting Systems -- Minimizing Deterministic Weighted Tree Automata -- Lower Bounds for Generalized Quantum Finite Automata -- How Many Figure Sets Are Codes? -- On Alternating Phrase-Structure Grammars -- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard -- Sorting and Element Distinctness on One-Way Turing Machines -- On Periodicity of Generalized Two-Dimensional Words -- On the Analysis of ?Simple? 2D Stochastic Cellular Automata -- Polycyclic and Bicyclic Valence Automata -- Length Codes, Products of Languages and Primality -- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. 330 $aThis book constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5196 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aComputer programming 606 $aComputer science 606 $aComputer science?Mathematics 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aSymbolic and Algebraic Manipulation 606 $aComputer Science Logic and Foundations of Programming 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aComputer programming. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a401.51 702 $aMartín Vide$b Carlos 702 $aOtto$b Friedrich 702 $aFernau$b Henning$f1965- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465588803316 996 $aLanguage and Automata Theory and Applications$9774044 997 $aUNISA