000			04810nam a22003975i 4500
001			294489
003			MX-SnUAN
005			20160429155147.0
007			cr nn 008mamaa
008			150903s2005 gw | o |||| 0|eng d
020			_a9783540305507 _99783540305507
024	7		_a10.1007/b103739 _2doi
035			_avtls000347473
039		9	_a201509031108 _bVLOAD _c201405070454 _dVLOAD _y201402070932 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA8.9-QA10.3
100	1		_aCalude, Cristian S. _eeditor. _9328099
245	1	0	_aDevelopments in Language Theory : _b8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004. Proceedings / _cedited by Cristian S. Calude, Elena Calude, Michael J. Dinneen.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_axI, 431 páginas Also available online. _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 ; _v3340
500			_aSpringer eBooks
505	0		_aInvited Papers -- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey -- Some New Directions and Questions in Parameterized Complexity -- Basic Notions of Reaction Systems -- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms -- Algebraic and Topological Models for DNA Recombinant Processes -- Contributed Papers -- Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet -- On Competence in CD Grammar Systems -- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels -- Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages -- On the Maximum Coefficients of Rational Formal Series in Commuting Variables -- On Codes Defined by Bio-operations -- Avoidable Sets and Well Quasi-Orders -- A Ciliate Bio-operation and Language Families -- Semantic Shuffle on and Deletion Along Trajectories -- Sturmian Graphs and a Conjecture of Moser -- P Systems Working in the Sequential Mode on Arrays and Strings -- Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings -- The Power of Maximal Parallelism in P Systems -- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars -- On the Complexity of 2-Monotone Restarting Automata -- On Left-Monotone Deterministic Restarting Automata -- On the Computation Power of Finite Automata in Two-Dimensional Environments -- The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems -- The Boolean Closure of Linear Context-Free Languages -- Context-Sensitive Decision Problems in Groups -- Decidability and Complexity in Automatic Monoids -- Relating Tree Series Transducers and Weighted Tree Automata -- An NP-Complete Fragment of LTL -- From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata -- Words Avoiding -Powers and the Thue–Morse Morphism -- On the Equivalence Problem for E-Pattern Languages Over Small Alphabets -- Complementation of Rational Sets on Countable Scattered Linear Orderings -- On the Hausdorff Measure of ?-Power Languages -- A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages -- Tissue P Systems with Minimal Symport/Antiport.
520			_aThis book constitutes the refereed proceedings of the 8th International Conference on Developments in Language Theory, DLT 2004, held in Auckland, New Zealand in December 2004. The 30 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 47 submissions. The main subjects are formal languages, automata, conventional and unconventional computation theory, and applications of automata theory. Among the topics addressed are grammars and acceptors for strings, graphs, and arrays; efficient text algorithms, combinatorial and algebraic properties of languages; decision problems; relations to complexity theory and logic; picture description and analysis; cryptography; concurrency; DNA computing; and quantum computing.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aCalude, Elena. _eeditor. _9328100
700	1		_aDinneen, Michael J. _eeditor. _9328101
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540240143
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b103739 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c294489 _d294489