000			05336nam a22005775i 4500
003			DE-He213
005			20191013150050.0
007			cr nn 008mamaa
008			100301s2008 gw | s |||| 0|eng d
020	6	4	_a9783540882824 _9978-3-540-88282-4
024	8	7	_a10.1007/978-3-540-88282-4 _2doi
050	8	4	_aQA8.9-QA10.3
072	8	7	_aUYA _2bicssc
072	8	7	_aMAT018000 _2bisacsh
072	8	7	_aCOM051010 _2bisacsh
082			_a005.131 _223
100	8	1	_aMartȡn-Vide, Carlos. _eeditor. _9144863
245	9	7	_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 Martȡn-Vide, Friedrich Otto, Henning Fernau.
001			000065594
300	6	4	_aXIV, 500 p. _bonline resource.
490	8	1	_aLecture Notes in Computer Science, _x0302-9743 ; _v5196
505	8	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 -- Hopcrofts 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.
520	6	4	_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	8	0	_aComputer science. _9144864
650	8	0	_aInformation theory. _9144865
650	8	0	_aLogic design. _9144866
650	8	0	_aAlgebra _xData processing. _911828
650			_aComputer Science. _9144867
650			_aMathematical Logic and Formal Languages. _910185
650			_aTheory of Computation. _9144868
650			_aSymbolic and Algebraic Manipulation. _911830
650			_aLogics and Meanings of Programs. _913880
650			_aMathematics of Computing. _910466
650			_aComputation by Abstract Devices. _99725
700	8	1	_aOtto, Friedrich. _eeditor. _9144869
700	8	1	_aFernau, Henning. _eeditor. _9144870
710	8	2	_aSpringerLink (Online service) _9144871
773	8	0	_tSpringer eBooks
776			_iPrinted edition: _z9783540882817
830	8	0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5196 _9144872
856			_uhttp://dx.doi.org/10.1007/978-3-540-88282-4 _zde clik aquí para ver el libro electrónico
264	8	1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008.
336	6	4	_atext _btxt _2rdacontent
337	6	4	_acomputer _bc _2rdamedia
338	6	4	_aonline resource _bcr _2rdacarrier
347	6	4	_atext file _bPDF _2rda
516	6	4	_aZDB-2-SCS
516	6	4	_aZDB-2-LNC
999			_c65324 _d65324
942			_c05