# Automata, Languages and Programming : 15th International Colloquium, Tampere, Finland, July 11-15, 1988. Proceedings.

Material type: TextSeries: Serienbezeichnung | Lecture Notes in Computer Science SerPublication details: New York : Springer, July 1988. Description: 1 online resource (xi, 741 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783540194880; 3540194886; 9783540392910; 3540392912Subject(s): Computer science | Computer software | Computer science | Computer softwareGenre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access onlineItem type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

Annotation This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics.

Communication complexity of PRAMs -- Average case complexity analysis of the RETE multi-pattern match algorithm -- Problems easy for tree-decomposable graphs extended abstract -- Serializability in distributed systems with handshaking -- Algorithms for planar geometric models -- Nonuniform learnability -- Zeta functions of recognizable languages -- Dynamic programming on graphs with bounded treewidth -- Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's -- Optimal slope selection -- Approximation of a trace, asynchronous automata and the ordering of events in a distributed system -- New techniques for proving the decidability of equivalence problems -- Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids -- The complexity of matrix transposition on one-tape off-line turing machines with output tape -- Geometric structures in computational geometry -- Arrangements of curves in the plane -- topology, combinatorics, and algorithms -- Reset sequences for finite automata with application to design of parts orienters -- Random allocations and probabilistic languages -- Systolic architectures, systems and computations -- New developments in structural complexity theory -- Operational semantics of OBJ-3 -- Do we really need to balance patricia tries? -- Contractions in comparing concurrency semantics -- A complexity theory of efficient parallel algorithms -- On the learnability of DNF formulae -- Efficient algorithms on context-free graph languages -- Efficient analysis of graph properties on context-free graph languages -- A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs -- Constructive Hopf's theorem: Or how to untangle closed planar curves -- Maximal dense intervals of grammar forms -- Computations, residuals, and the power of indeterminacy -- Nested annealing: A provable improvement to simulated annealing -- Nonlinear pattern matching in trees -- Invertibility of linear finite automata over a ring -- Moving discs between polygons -- Optimal circuits and transitive automorphism groups -- A Kleene-presburgerian approach to linear production systems -- On minimum flow and transitive reduction -- La Reconnaissance Des Facteurs D'un Langage Fini Dans Un Texte En Temps Lineaire -- Resume -- Regular languages defined with generalized quantifiers -- A dynamic data structure for planar graph embedding -- Separating polynomial-time turing and truth-table reductions by tally sets -- Assertional verification of a timer based protocol -- Type inference with partial types -- Some behavioural aspects of net theory -- The equivalence of dgsm replications on Q-rational languages is decidable -- Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs -- On restricting the access to an NP-oracle -- On? 1?tt p -sparseness and nondeterministic complexity classes -- Semantics for logic programs without occur check -- Outer narrowing for equational theories based on constructors.