Automata, Languages and Programming

22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings

By: Zoltan Fülöp (Editor), Ferenc Gecseg (Editor)

Write A Review

Paperback | 28 June 1995

At a Glance

Paperback
708 Pages

Dimensions(cm)
23.39 x 15.6 x 3.61

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

This volume constitutes the proceedings of the 22nd Interna- tional Colloquium on Automata, Languages, and Programming, held under the sponsorship of EATCS in Szeged, Hungary in July 1995.
The volume presents four invited papers and 53 full revised research papers selected from a total of 111 submissions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.

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 $79.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 Engineering & Technology Electronics & Communications Engineering Electronics Engineering Automatic Control Engineering Robotics Graphical & Digital Media Applications

3D Graphics & Modelling Computer Security Data Encryption Compilers & Interpreters

Theory of 2 Structures	p. 1
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces	p. 15
Nonfinite Axiomatizability of the Equational Theory of Shuffle	p. 27
The Algebraic Equivalent of AFL Theory	p. 39
Finite State Transformations of Images	p. 51
Post Correspondence Problem: Words Possible as Primitive Solutions	p. 63
Computing the Closure of Sets of Words under Partial Commutations	p. 75
Intervalizing k-Colored Graphs	p. 87
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings	p. 99
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications	p. 111
How to Use the Minimal Separators of a Graph for its Chordal Triangulation	p. 123
Fast Gossiping by Short Messages	p. 135
Break Finite Automata Public Key Cryptosystem	p. 147
Short Memory in Stochastic Graphs: Fully Dynamic Connectivity in Poly-Log Expected Time	p. 159
On the Number of Random Bits in Totally Private Computation	p. 171
Lower Time Bounds for Randomized Computation	p. 183
New Collapse Consequences of NP Having Small Circuits	p. 196
The Complexity of Searching Succinctly Represented Graphs	p. 208
Optimal Shooting: Characterizations and Applications	p. 220
Placing Resources in a Tree: Dynamic and Static Algorithms	p. 232
Shortest Path Queries in Digraphs of Small Treewidth	p. 244
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs	p. 256
Parallel Algorithms with Optimal Speedup for Bounded Treewidth	p. 268
Approximating Minimum Cuts under Insertions	p. 280
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-Free Graphs	p. 292
On-line Resource Management with Applications to Routing and Scheduling	p. 303
Alternation in Simple Devices	p. 315
Hybrid Automata with Finite Bisimulations	p. 324
Generalized Sturmian Languages	p. 336
Polynomial Closure and Unambiguous Product	p. 348
Lower Bounds on Algebraic Random Access Machines	p. 360
Improved Deterministic PRAM Simulation on the Mesh	p. 372
On Optimal Polynomial Time Approximations: P-Levelability vs. [Delta]-Levelability	p. 384
Weakly Useful Sequences	p. 393
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree	p. 405
The Expressive Power of Clocks	p. 417
Grammar Systems: A Grammatical Approach to Distribution and Cooperation	p. 429
Compactness of Systems of Equations in Semigroups	p. 444
Sensing versus Nonsensing Automata	p. 455
New Upper Bounds for Generalized Intersection Searching Problems	p. 464
OKFDDs versus OBDDs and OFDDs	p. 475
Bicriteria Network Design Problems	p. 487
On Determining Optimal Strategies in Pursuit Games in the Plane	p. 499
Extension Orderings	p. 511
The PushDown Method to Optimize Chain Logic Programs	p. 523
Automatic Synthesis of Real Time Systems	p. 535
Self-Correcting for Function Fields of Finite Transcendental Degree	p. 547
Measure, Category and Learning Theory	p. 558
A Characterization of the Existence of Energies for Neural Networks	p. 570
Variable-Length Codes for Error Correction	p. 581
Graphbots: Mobility in Discrete Spaces	p. 593
Solving Recursive Net Equations	p. 605
Implicit Definability and Infinitary Logic in Finite Model Theory	p. 624
The Limit of Split[subscript n]-Language Equivalence	p. 636
Divergence and Fair Testing	p. 648
Causality for Mobile Processes	p. 660
Internal Mobility and Agent-Passing Calculi	p. 672
Author Index	p. 685
Table of Contents provided by Blackwell. All Rights Reserved.

Automata, Languages and Programming

22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

Python Crash Course

3rd Edition - A Hands-On, Project-Based Introduction to Programming

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

Nexus

A Brief History of Information Networks from the Stone Age to AI

If Anyone Builds It, Everyone Dies

The Case Against Superintelligent AI

Creative Machines

AI, Art & Us

Genesis

Artificial Intelligence, Hope, and the Human Spirit

The Tech Coup

How to Save Democracy from Silicon Valley

The Coming Wave

AI, Power and the 21st Century's Greatest Dilemma

New Beginnings

why change is so difficult and how to achieve it

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

The Shortest History of AI

Building Machine Learning Systems with a Feature Store

Batch, Real-Time, and LLM Systems

Python Workout, Second Edition

200 ten-minute exercises

Philosophy of Science for Machine Learning

Core Issues and New Perspectives

Life 3.0

Being Human in the Age of Artificial Intelligence

Python All-in-One For Dummies

3rd Edition

Storytelling with Data

A Data Visualization Guide for Business Professionals, 10th Anniversary Edition

Artificial Intelligence

A Modern Approach, 4th Global Edition

Falter

Has the Human Game Begun to Play Itself Out?

Fundamentals of Software Architecture

A Modern Engineering Approach

Effective Modern C++

42 Specific Ways to Improve Your Use of C++11 And C++14

This product is categorised by