Automata, Languages and Programming: 19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $16.25
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Paperback)
  • All (10) from $16.25   
  • New (6) from $107.90   
  • Used (4) from $16.25   


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
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.
Read More Show Less

Product Details

  • ISBN-13: 9783540557197
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 7/29/1992
  • Series: Lecture Notes in Computer Science Series, #623
  • Edition description: 1992
  • Edition number: 1
  • Pages: 724
  • Product dimensions: 6.10 (w) x 9.20 (h) x 1.30 (d)

Table of Contents

Philosophical issues in Kolmogorov complexity.- Circuit complexity and the expressive power of generalized first-order formulas.- One-message statistical Zero-Knowledge Proofs and space-bounded verifier.- Abelian squares are avoidable on 4 letters.- Polynomial size test sets for context-free languages.- Quasi-deterministic 0L systems.- On growing context-sensitive languages.- Numeration systems, linear recurrences, and regular sets.- The equality problem for rational series with multiplicities in the tropical semiring is undecidable.- Semi-commutations and rational expressions.- New results concerning synchronized finite automata.- A Greibach normal form for context-free graph grammars.- On reverse and general definite tree languages.- Reductions to sets of low information content.- UP and the low and high hierarchies: A relativized separation.- Analytic analysis of algorithms.- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems.- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects.- Polynomial hash functions are reliable.- Adaptive pattern matching.- Randomized interpolation and approximation of sparse polynomials stPreliminary version.- Two strikes against perfect phylogeny.- Disjunctive systems and L-Domains.- Optimal parallel algorithms for periods, palindromes and squares.- Near-perfect token distribution.- Fast integer merging on the EREW PRAM.- Approximation algorithms for graph augmentation.- Fast incremental planarity testing.- Maintenance of triconnected components of graphs.- Suboptimal cuts: Their enumeration, weight and number.- Gröbner bases: An introduction.- Buchberger's algorithm: The term rewriter's point of view.- Completion of rewrite systems with membership constraints.- A new metric between polygons, and how to compute it.- On nearest-neighbor graphs.- A tail estimate for Mulmuley's segment intersection algorithm.- Lower bounds on the complexity of simplex range reporting on a pointer machine.- Infinitary logic for computer science.- Characterization of temporal property classes.- Lazy Lambda calculus: Theories, models and local structure characterization.- Logic programming semantics made easy.- On the complexity of dataflow analysis of logic programs.- Comparison of abstract interpretations.- A proposed categorical semantics for Pure ML.- What good are digital clocks?.- Behavioural abstraction in TCCS.- Timing Petri Nets categorically.- Asynchronous cellular automata for infinite traces.- A trace semantics for Petri Nets.- Asynchronous communication of Petri Nets and the refinement of transitions.- A parametric approach to localities.- Proved trees.- Interfaces between languages for communicating systems.- Toward formal development of programs from algebraic specifications: Model-theoretic foundations.- Program composition via unification.- Barbed bisimulation.- Checking equivalences between concurrent systems of finite agents (Extended abstract).- Testing preorders for probabilistic processes.
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)