000 | 04891nam a22004095i 4500 | ||
---|---|---|---|
001 | 301225 | ||
003 | MX-SnUAN | ||
005 | 20160429155701.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2010 gw | o |||| 0|eng d | ||
020 |
_a9783642144554 _99783642144554 |
||
024 | 7 |
_a10.1007/9783642144554 _2doi |
|
035 | _avtls000355425 | ||
039 | 9 |
_a201509030955 _bVLOAD _c201405060350 _dVLOAD _y201402191043 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA76.9.A43 | |
100 | 1 |
_aGao, Yuan. _eeditor. _9338983 |
|
245 | 1 | 0 |
_aDevelopments in Language Theory : _b14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings / _cedited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
300 |
_axii, 446 páginas 48 ilustraciones _brecurso en línea. |
||
336 |
_atexto _btxt _2rdacontent |
||
337 |
_acomputadora _bc _2rdamedia |
||
338 |
_arecurso en línea _bcr _2rdacarrier |
||
347 |
_aarchivo de texto _bPDF _2rda |
||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6224 |
|
500 | _aSpringer eBooks | ||
505 | 0 | _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. | |
520 | _aThis book constitutes the proceedings of the 14th International Conference on Developments in Language Theory, DLT 2010, held in London, Ontario, Canada, in August 2010. The 32 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or abstracts of 6 invited speakers, as well as a 2-page abstract for each of the 6 poster papers. The topics addressed are formal languages, automata theory, computability, complexity, logic, petri nets and related areas. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aLu, Hanlin. _eeditor. _9338984 |
|
700 | 1 |
_aSeki, Shinnosuke. _eeditor. _9338985 |
|
700 | 1 |
_aYu, Sheng. _eeditor. _9327843 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783642144547 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-14455-4 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c301225 _d301225 |