Artículos relacionados a Automata, Languages, and Programming: 11th Colloquium,...
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings: 172 (Lecture Notes in Computer Science) - Tapa blanda
Sinopsis
Autómatas, idiomas y programación: 11º Coloquio, Amberes, Bélgica, 16-20 de julio de 1984 (signo Eatcs). Proceedings Automata, Languages and Programming: 11º Coloquio, Amberes, Bélgica, 16-20 de julio de 1984 (Eatcs Sign). Procedimientos
"Sinopsis" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 50,28
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Automata, Languages, and Programming: 11th Colloquium,...
Imagen del vendedor
Automata, Languages, and Programming. 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings.
Publicado por
Berlin, Springer Berlin Heidelberg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Antiguo o usado
Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7775 3540133453 Sprache: Englisch Gewicht in Gramm: 900. Nº de ref. del artículo: 2347473
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages, and Programming
Publicado por
Springer Berlin Heidelberg Jun 1984, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of data dependencies ¿ An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplier with minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexit¿es facteurs des mots infinis engendr¿par morphismes it¿s.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP ¿ like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract). 540 pp. Englisch. Nº de ref. del artículo: 9783540133452
Cantidad disponible: 2 disponibles
Imagen del vendedor
Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings
Publicado por
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The theory of data dependencies ¿ An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplier with minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexit¿es facteurs des mots infinis engendr¿par morphismes it¿s.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP ¿ like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract). Nº de ref. del artículo: 9783540133452
Cantidad disponible: 1 disponibles
Imagen de archivo
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science, 172)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540133452_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages, and Programming
Publicado por
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 4882153
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science)
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540133452
Cantidad disponible: 10 disponibles
Imagen de archivo
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science)
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Nº de ref. del artículo: UTD14a-0853
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages, and Programming
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1984, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Neuware -The theory of data dependencies ¿ An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplier with minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexit¿es facteurs des mots infinis engendr¿par morphismes it¿s.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP ¿ like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 540 pp. Englisch. Nº de ref. del artículo: 9783540133452
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (Eatcs Sign). Proceedings
Publicado por
Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 1984 edition. 535 pages. 9.25x6.10x1.22 inches. In Stock. Nº de ref. del artículo: x-3540133453
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science, 172)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020160158
Cantidad disponible: Más de 20 disponibles