000			04627nam a22003615i 4500
001			324033
003			MX-SnUAN
005			20200811095640.0
007			cr nn 008mamaa
008			160111s2014 gw | s |||| 0|eng d
020			_a9783662445228 _9978-3-662-44522-8
035			_avtls000424139
039		9	_y201601111049 _zstaff
050		4	_aQA76.9.A43
245	1	0	_aMathematical foundations of computer science 2014 : _b39th international symposium, mfcs 2014, budapest, hungary, august 25-29, 2014. Proceedings, part I / _cedited by Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bSpringer, _c2014.
300			_axxvi, 561 páginas : _b65 ilustraciones
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 ; _v8634
500			_aSpringer eBooks
505	0		_aTable of Contents - Volume I.-Invited contributions -- Partial-Observation Stochastic Reachability and Parity Games -- Every graph is easy or hard: dichotomy theorems for graph problems -- Computer Poker and Computational Game Theory -- Random Deterministic Automata -- Communication Complexity Theory: Thirty-Five Years of Set Disjointness -- What does the local structure of a planar graph tell us about its global structure? -- Logic, Semantics, Automata and Theory of Programming -- Choiceless Polynomial Time on structures with small Abelian colour Classes -- Sofic-Dyck shifts -- A Logical Characterization of Timed (non-)Regular Languages -- Asymptotic Monadic Second-Order Logic -- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules -- Alternating Parity Krivine Automata -- Advances in Parametric Real-Time Reasoning -- Universal Lyndon Words -- Subword complexity and decomposition of the set of factors -- Cyclic Complexity of Words -- Classifying Recognizable Infinitary Trace Languages Using Word Automata -- Bounded variable logic, parameterized logarithmic space, and Savitch’s Theorem -- An algebraic characterization of unary two-way transducers -- Size-Change Abstraction and Max-Plus Automata -- Alternating Vector Addition Systems with States -- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach -- Relating Nominal and Higher-Order Rewriting -- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures -- Two Recursively Inseparable Problems for Probabilistic Automata -- Monadic Second-Order Logic with Arbitrary Monadic Predicates -- Transforming two-way alternating finite automata to one-way nondeterministic automata -- Measure Properties of Game Tree Languages -- On Upper and Lower Bounds on the Length of Alternating Towers -- LaxF: Side Conditions and External Evidence as Monads -- The monoid of queue actions -- Undecidable properties of self-affine sets and multi-tape automata -- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality -- A Unifying Approach for Multistack Pushdown Automata -- Definability and Transformations for Cost Logics and Automatic Structures -- Generalised Lyndon-Schützenberger Equations -- Complexity of Equivalence and Learning for Multiplicity Tree Automata -- Monadic datalog and regular tree pattern queries -- Model Checking Concurrent Recursive Programs using Temporal Logics -- Decidability of the interval temporal logic AABB over the rationals -- Reachability in Pushdown Register Automata -- A Generalization of the ?os-Tarski Preservation Theorem over Classes of Finite Structures -- Determinising Parity Automata -- Tight Bounds for Complementing Parity Automata -- On Infinite Words Determined by Indexed Languages -- A Pumping Lemma for Two-Way Finite Transducers -- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems -- The Dynamic Descriptive Complexity of k-Clique.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aCsuhaj-Varjú, Erzsébet, _eeditor. _9332778
700	1		_aDietzfelbinger, Martin, _eeditor. _9338319
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783662445211
700	1		_9430322 _aÉsik, Zoltán, _d1951- _eeditor.
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-662-44522-8 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c324033 _d324033