Items related to 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, 172) - Softcover
Synopsis
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (Eatcs Sign). Proceedings Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (Eatcs Sign). Proceedings
"synopsis" may belong to another edition of this title.
Search results for Automata, Languages, and Programming: 11th Colloquium,...
Stock Image
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540133452
Buy New
£ 45.89
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Automata, Languages, and Programming
Published by
Springer Berlin Heidelberg Jun 1984, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540133452
Stock Image
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings (Lecture Notes in Computer Science, 172)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In English. Seller Inventory # ria9783540133452_new
Buy New
£ 53.69
£ 11.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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 multiplierwith 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é des facteurs des mots infinis engendrés par morphismes itéré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). Seller Inventory # 9783540133452
Seller Image
Automata, Languages, and Programming
Published by
Springer Berlin Heidelberg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4882153
Buy New
£ 40.15
£ 41.75 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Automata, Languages, and Programming
Published by
Springer, Springer Jun 1984, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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 multiplierwith 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é des facteurs des mots infinis engendrés par morphismes itéré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 KG, Sachsenplatz 4-6, 1201 Wien 540 pp. Englisch. Seller Inventory # 9783540133452
Seller Image
Automata, Languages, and Programming | 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Automata, Languages, and Programming | 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings | J. Paredaens | Taschenbuch | x | Englisch | 1984 | Springer | EAN 9783540133452 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 101947182
Stock Image
Automata, Languages, and Programming: 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (Eatcs Sign). Proceedings
Published by
Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg, 1984
ISBN 10: 3540133453
ISBN 13: 9783540133452
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 1984 edition. 535 pages. 9.25x6.10x1.22 inches. In Stock. Seller Inventory # x-3540133453
Buy New
£ 87.48
£ 20 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available