000 05686nam a22006255i 4500
001 978-3-540-88282-4
003 DE-He213
005 20240730193044.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540882824
_9978-3-540-88282-4
024 7 _a10.1007/978-3-540-88282-4
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aLanguage and Automata Theory and Applications
_h[electronic resource] :
_bSecond International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers /
_cedited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXIV, 500 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5196
505 0 _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-Boundswith 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.
520 _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.
650 0 _aMachine theory.
_9152271
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aFormal Languages and Automata Theory.
_9152272
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9152273
650 2 4 _aTheory of Computation.
_9152274
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
700 1 _aMartin-Vide, Carlos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152275
700 1 _aOtto, Friedrich.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152276
700 1 _aFernau, Henning.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152277
710 2 _aSpringerLink (Online service)
_9152278
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540882817
776 0 8 _iPrinted edition:
_z9783540882831
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5196
_9152279
856 4 0 _uhttps://doi.org/10.1007/978-3-540-88282-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94569
_d94569