000			05096nam a22004095i 4500
001			294356
003			MX-SnUAN
005			20160429155143.0
007			cr nn 008mamaa
008			150903s2005 gw | o |||| 0|eng d
020			_a9783540305002 _99783540305002
024	7		_a10.1007/b105090 _2doi
035			_avtls000347459
039		9	_a201509030439 _bVLOAD _c201405070456 _dVLOAD _y201402070932 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA75.5-76.95
100	1		_aDomaratzki, Michael. _eeditor. _9327840
245	1	0	_aImplementation and Application of Automata : _b9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / _cedited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_axii, 336 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 ; _v3317
500			_aSpringer eBooks
505	0		_aInvited Papers -- Automata-Theoretic Techniques for Analyzing Infinite-State Systems -- Enumerating Regular Expressions and Their Languages -- Contributed Papers -- A General Weighted Grammar Library -- On the Complexity of Hopcroft’s State Minimization Algorithm -- Implementation of Catalytic P Systems -- Code Selection by Tree Series Transducers -- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages -- Brute Force Determinization of NFAs by Means of State Covers -- Computing the Follow Automaton of an Expression -- Viral Gene Compression: Complexity and Verification -- Concatenation State Machines and Simple Functions -- FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views -- Finding Finite Automata That Certify Termination of String Rewriting -- Linear Encoding Scheme for Weighted Finite Automata -- The Generalization of Generalized Automata: Expression Automata -- An Automata Approach to Match Gapped Sequence Tags Against Protein Database -- State Complexity of Concatenation and Complementation of Regular Languages -- Minimal Unambiguous ?NFA -- Substitutions, Trajectories and Noisy Channels -- State Complexity and the Monoid of Transformations of a Finite Set -- An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract) -- Time and Space Efficient Algorithms for Constrained Sequence Alignment -- Stochastic Context-Free Graph Grammars for Glycoprotein Modelling -- Parametric Weighted Finite Automata for Figure Drawing -- Regional Finite-State Error Repair -- Approximating Dependency Grammars Through Intersection of Regular Languages -- On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata -- Poster Papers -- Tight Bounds for NFA to DFCA Transformations for Binary Alphabets -- Simulating the Process of Gene Assembly in Ciliates -- A BDD-Like Implementation of an Automata Package -- Approximation to the Smallest Regular Expression for a Given Regular Language -- Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory -- Does Hausdorff Dimension Measure Texture Complexity? -- Combining Regular Expressions with (Near-)Optimal Brzozowski Automata -- From Automata to Semilinear Sets: A Logical Solution for Sets ( , ) -- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids -- Minimalizations of NFA Using the Universal Automaton -- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata -- Size Reduction of Multitape Automata -- Testability of Oracle Automata -- Magic Numbers for Symmetric Difference NFAs.
520			_aThis book constitutes the thoroughly refereed post-proceedings of the 9th International Conference on Implementation and Application of Automata, CIAA 2004, held in Kingston, Canada in July 2004. The 25 revised full papers and 14 revised poster papers presented together with 2 invited contributions have gone through two rounds of reviewing and improvement. The topics covered range from applications of automata in natural language and speech processing to protein sequencing and gene compression, and from state complexity and new algorithms for automata operations to applications of quantum finite automata.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aOkhotin, Alexander. _eeditor. _9327841
700	1		_aSalomaa, Kai. _eeditor. _9327842
700	1		_aYu, Sheng. _eeditor. _9327843
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540243182
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b105090 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c294356 _d294356