Automata, Languages and Programming: 21st International Colloquium, ICALP 94, Jerusalem, Israel, July 11-14, 1994 : Proceedings
North-Holland Publ., 1994 - Computers - 644 pages
"This volume constitutes the proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP 94), held at Jerusalem in July 1994. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contains 48 refereed papers selected from 154 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on theory of computation, automata and computation models, expressive power, automata and concurrency, pattern matching, data structures, computational complexity, logic and verification, formal languages, term rewriting, algorithms and communications, graph algorithms, randomized complexity, various algorithms."--PUBLISHER'S WEBSITE.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Theory of Computation
On The Computational Power of Probabilistic and Faulty Neural Networks
Tight Bounds on Pebbling with Faults
15 other sections not shown
Other editions - View all
Abstract algebraic algorithm assume asynchronous automata automaton binary bisimulation bistructures Boolean buckets Cartesian tree coalgebras comonad complexity Computer Science concurrency configuration construction Corollary defined Definition denote deterministic domain edges elements encoding environment equations equivalence fair rational path finite fixpoints formula function given global hashing Hence hypercubic induced infinite input integer iteration k-structure Kripke structures labelled transition system language Lemma length linear linear logic logic lossy channel system lower bound mapping model checking monoid multiway cut node nondeterministic O(log obtained operational semantics optimal oracle oracle machine output pair parallel pebbles polynomial prefix probabilistic problem Proc proof outline Proposition PSPACE-complete queries random reachability recursive reduction relation result rules satisfies secret sharing sequence sorting networks string subset temporal logic Theorem theory topology tree Turing machine variables vertex vertices