Del 172 - Lecture Notes in Computer Science

Automata, Languages, and Programming

11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings

Häftad, Engelska, 1984

Av J. Paredaens

699 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1984-06-01
Mått155 x 235 x 29 mm
Vikt809 g
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor530
Upplaga1984
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
EAN9783540133452

Du kanske också är intresserad av

Advances in Database Systems

Del 347

Advances in Database Systems

J. Paredaens, L. Tenenbaum

739 kr

Alchemised (svensk utgåva)

Nyhet

Alchemised (svensk utgåva)

259 kr

Vitön. : Den fristående fortsättningen på Expeditionen

Nyhet

Vitön. : Den fristående fortsättningen på Expeditionen

399 kr

Hembiträdet

Del 1

Hembiträdet

Freida McFadden

179 kr

Hon som blev kvar

4 pocket för 3

Hon som blev kvar

125 kr

Den yttersta hemligheten

Nyhet

Del 6

Den yttersta hemligheten

329 kr

Den förlorade symbolen

4 pocket för 3

Del 3

Den förlorade symbolen

79 kr125 kr

Hjärtslag : En självbiografi

Nyhet

Hjärtslag : En självbiografi

Björn Borg, Patricia Borg

349 kr

Historiens återkomst: Europa och världsordningens sammanbrott

Nyhet

Historiens återkomst: Europa och världsordningens sammanbrott

329 kr

Kvinnorna

4 pocket för 3

Kvinnorna

125 kr

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it

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).