Lecture Notes in Computer Science

19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings

By: Werner Kuich (Editor)

Write A Review

Paperback | 1 July 1992

At a Glance

Paperback
736 Pages

Dimensions(cm)
23.39 x 15.6 x 3.73

Paperback

$169.75

or 4 interest-free payments of $42.44 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Mathematical Theory of Computation Computer Programming & Software Development Programming & Scripting Languages Algorithms & Data Structures Mathematics Mathematical Foundation Mathematical Logic Graphical & Digital Media Applications 3D Graphics & Modelling

Artificial Intelligence Combinatorics & Graph Theory Discrete Mathematics Databases

Complexity (Session 1)
Philosophical Issues in Kolmogorov Complexity (Invited Lecture)	p. 1
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas	p. 16
One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier	p. 28
Formal Languages (Session 2)
Abelian Squares Are Avoidable on 4 Letters	p. 41
Polynomial Size Test Sets for Context-Free Languages	p. 53
Quasi-Deterministic OL Systems	p. 65
On Growing Context-Sensitive Languages	p. 77
Finite Automata (Session 3)
Numeration Systems, Linear Recurrences, and Regular Sets	p. 89
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable	p. 101
Semi-Commutations and Rational Expressions	p. 113
New Results Concerning Synchronized Finite Automata	p. 126
Graph Grammars and Complexity (Session 4)
A Greibach Normal Form for Context-Free Graph Grammars	p. 138
On Reverse and General Definite Tree Languages	p. 150
Reductions to Sets of Low Information Content	p. 162
UP and the Low and High Hierarchies: A Relativized Separation	p. 174
Algorithm Analysis (Session 5)
Analytic Analysis of Algorithms (Invited Lecture)	p. 186
How to Count Quickly and Accurately	p. 211
The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects	p. 223
Algorithms (Session 6)
Polynomial Hash Functions Are Reliable	p. 235
Adaptive Pattern Matching	p. 247
Randomised Interpolation and Approximation of Sparse Polynomials	p. 261
Two Strikes Against Perfect Phylogeny	p. 273
Parallel Computation (Session 7)
Disjunctive Systems and L-Domains	p. 284
Optimal Parallel Algorithms for Periods, Palindromes and Squares	p. 296
Near-Perfect Token Distribution	p. 308
Fast Integer Merging on the EREW PRAM	p. 318
Graph Algorithms (Session 8)
Approximation Algorithms for Graph Augmentation	p. 330
Fast Incremental Planarity Testing	p. 342
Maintenance of Triconnected Components of Graphs	p. 354
Suboptimal Cuts: Their Enumeration, Weight and Number	p. 366
Symbolic Computation (Session 9)
Grobner Bases: An Introduction (Invited Lecture)	p. 378
Buchberger's Algorithm: The Term Rewriter's Point of View	p. 380
Completion of Rewrite Systems with Membership Constraints	p. 392
Geometric Algorithms (Session 10)
A New Metric Between Polygons, and How to Compute it	p. 404
On Nearest-Neighbor Graphs	p. 416
A Tail Estimate for Mulmuley's Segment Intersection Algorithm	p. 427
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine	p. 439
Logic and Models I (Session 11)
Infinitary Logic for Computer Science (Invited Lecture)	p. 450
Characterization of Temporal Property Classes	p. 474
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization	p. 487
Logic and Models II (Session 12)
Logic Programming Semantics Made Easy	p. 499
On the Complexity of Dataflow Analysis of Logic Programs	p. 509
Comparison of Abstract Interpretations	p. 521
A Proposed Categorical Semantics for Pure ML	p. 533
Time Specification (Session 13)
What Good Are Digital Clocks?	p. 545
Behavioural Abstraction in TCCS	p. 559
Timing Petri Nets Categorically	p. 571
Asynchronous Cellular Automata for Infinite Traces	p. 583
Concurrency Semantics (Session 14)
A Trace Semantics for Petri Nets	p. 595
Asynchronous Communication of Petri Nets and the Refinement of Transitions	p. 605
A Parametric Approach to Localities	p. 617
Proved Trees	p. 629
Program Development (Session 15)
Interfaces Between Languages for Communicating Systems (Invited Lecture)	p. 641
Toward Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations (Invited Lecture)	p. 656
Process Equivalences (Session 16)
Program Composition via Unification	p. 672
Barbed Bisimulation	p. 685
Checking Equivalences Between Concurrent Systems of Finite Agents	p. 696
Testing Preorders for Probabilistic Processes	p. 708
Author Index	p. 721
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Discrete Mathematics for Computing

Grassroots

How to Prove It

A Structured Approach

Robotic Swarming Control via Voronoi Tessellations

Foundations and Applications

Weakened Ramsey Theory

Discrete Mathematics and Its Applications

Introduction to Automata Theory and Formal Languages

A Logic Building and Problem-solving Approach

Handbook of Combinatorial Algebraic Geometry

Subvarieties of the Flag Variety

The Math Thought Mindset

Logic, Reasoning, and Proofs

A Tour through Graph Theory

Textbooks in Mathematics

A Tour through Graph Theory

Textbooks in Mathematics

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

Introduction to Modern Cryptography

Revised Third Edition

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Textbooks in Mathematics

Modeling, Simulation and Design

Discrete Mathematics and Its Applications

2025 Release ISE

Marxian Economics

A New Japanese Tradition

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Federated Learning for Smart Communication using IoT Application

Lights and Shadows on Generalizations in Fixed Point Theory

Topics in Mathematical Modeling by Difference Equations

With Mathematica

AK Peters/CRC Recreational Mathematics

60 Years of Mathematical Puzzles in Parabola

Discrete Choice Models

Mathematical Methods, Econometrics, and Data Science

Extremal Graph and Hypergraph Theory

With Ramsey Theory

The Shrikhande Graph

A Window on Discrete Mathematics

This product is categorised by