Automata, Languages, and Programming : 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings. 1st ed. 1984

種類:

電子ブック

責任表示:

edited by J. Paredaens

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1984

著者名:

• Paredaens, J.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 172

ISBN:

9783540388869 [3540388869]    

注記:

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 -- Co

ローカル注記:

学内専用E-BOOKS (local access only)