Automata, Languages and Programming: 19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings
Springer, Jul 29, 1992 - Computers - 719 pages
This volume presents the proceedings of the 19th International Colloquium onAutomata, Languages, and Programming (ICALP 92) in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP is a broadly based conference covering all aspects of theoretical computer science, including such topics as computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design andlayout, parallel and distributed computation, theory of concurrency, and theory of robotics. The papers in the volume are grouped into thematic parts corresponding to their order of presentation at ICALP 92.
77 pages matching integer in this book
Results 1-3 of 77
What people are saying - Write a review
We haven't found any reviews in the usual places.
Algorithm Analysis Session
Symbolic Computation Session
35 other sections not shown
algebraic algorithm alphabet analysis assume asymptotic automaton characterization coefficients combinatorial compatible letter complexity components Computer Science consider construction contains context-free context-free grammars context-free languages context-sensitive grammars Corollary corresponding Datalog defined definition denote derivation disjunctive system elements entropy equation equivalent exists formula graph G Greibach Normal Form hash functions Hence high hierarchies hypergraph input integer iterating factor Kolmogorov complexity L-domain label Lemma length linear logic lower bound machine matching Mellin transform monoid morphism node nonterminal normal form Notes in Computer NP-complete numerical predicates obtain OL system optimal pair patterns polynomial polynomial-time prefix Proc productions Proposition prove query random recurrence reduces regular languages result semi-commutation semigroup sequence sparse set string strongly connected strongly connected components subgraph subset subwords symbol synchronizing syntactic semigroup term test set Theorem theory tree language undirected graph variables vectors verifier vertex vertices word zero-knowledge proof