Automata, Languages, and Programming: 17th International Colloquium, Warwick University, England, July 16-20, 1990 : Proceedings
Michael S. Paterson
Springer-Verlag, 1990 - Computers - 780 pages
"This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted."--PUBLISHER'S WEBSITE.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
A-calculus abstract algebra algorithm alphabet automata automaton binary bit complexity bound calculus call-by-value called computation path computation sequences Computer Science concurrent automaton configuration congruence consider constant construction Corollary corresponding defined definition denote deterministic dictionary domain edge elements enumerated equations example exists finite graph hash functions Hence identity induction infinite input integer interactive proofs labelled lambda calculus language learner learning Lemma length Lin-Kernighan logic Markov chain monoid nodes nondeterministic normal form notation operation operational semantics optimal oracle set output P-complete pair parallel partially ordered phase polynomial ports problem Proc processes processors programming proof of Theorem Proposition protocol prove queries random recursive reduction registers regular language representation class result satisfies semantics semigroup semiring sequential simulation space measure string structure subset Theorem theory transition trees triangle Turing machine typable variables Voronoi Voronoi diagram zero-knowledge zero-knowledge proof