Del i serien Lecture Notes in Computer Science

Automata, Languages and Programming

20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings

Häftad, Engelska, 1993

AvAndrzej Lingas,Rolf Karlsson,Svante Carlsson

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

The International Colloquium on Automata, Languages andProgramming (ICALP) is an annual conference series sponsoredby the European Association for Theoretical Computer Science(EATCS). It is intended to cover all important areas oftheoretical computer science, such as: computability,automata,formal languages, term rewriting, analysis ofalgorithms, computational geometry, computationalcomplexity, symbolic and algebraic computation,cryptography, data types and data structures, theory ofdata bases and knowledge bases, semantics of programminglanguages, program specification, transformation andverification, foundations of logicprogramming, theory oflogical design and layout, parallel and distributedcomputation, theory of concurrency, and theory of robotics.This volume contains the proceedings of ICALP 93, held atLundUniversity, Sweden, in July 1993. It includes fiveinvited papers and 51 contributed papers selected from 151submissions.

Produktinformation

Utgivningsdatum1993-06-23
Mått155 x 233 x 39 mm
Vikt1 066 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor703
Upplaga1993
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540569398

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Program result checking: A new approach to making programs more reliable.- Dynamic interpolation search in o(log log n) time.- Searching among intervals and compact routing tables.- The approximation of maximum subgraph problems.- Polynomially bounded minimization problems which are hard to approximate.- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover.- The complexity of approximating PSPACE-complete problems for hierarchical specifications.- Problems on pairs of trees and the four colour problem of planar graphs.- Constructing competitive tours from local information.- Treewidth and pathwidth of permutation graphs.- A theory of even functionals and their algorithmic applications.- Exact asymptotics of divide-and-conquer recurrences.- Optimal bounds for the change-making problem.- The complexity of N-body simulation.- A simple method for resolving degeneracies in Delaunay triangulations.- Fault-tolerance and complexity (Extended abstract).- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines.- On the computational power of discrete Hopfield nets.- On randomized versus deterministic computation.- Lower bounds for one-way probabilistic communication complexity.- Maintaining discrete probability distributions optimally.- Secure and efficient off-line digital money (extended abstract).- Computational depth and reducibility.- Learnability: Admissible, co-finite, and hypersimple languages.- Inclusion is undecidable for pattern languages.- New decidability results concerning two-way counter machines and applications.- Cobham's Theorem seen through Büchi's Theorem.- Logical definability on infinite traces.- Algebras for classifying regular tree languages and anapplication to frontier testability.- Finite automata as characterizations of minor closed tree families (extended abstract).- On distributed algorithms in a broadcast domain.- Sparse networks supporting efficient reliable broadcasting.- Strongly adaptive token distribution.- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic.- Fast parallel constraint satisfaction.- The product of rational languages.- On regular compatibility of semi-commutations.- Algebraic aspects of B-regular series.- Products of finite state machines with full coverage.- An effective version of Stallings' theorem in the case of context-free groups.- On the power of periodic iteration of morphisms.- If a DOL language is k-power free then it is circular.- Deciding true concurrency equivalences on finite safe nets (preliminary report).- Timed testing of concurrent systems.- The fork calculus.- Extended transition systems for parametric bisimulation.- Temporal logic and categories of Petri nets.- Decidability of a partial order based temporal logic.- Local model checking for context-free processes.- Computing on structures.- A partial solution for D-unification based on a reduction to AC 1-unification.- Efficient analysis of concurrent constraint logic programs.- A confluent reduction for the extensional typed ?-calculus with pairs, sums, recursion and terminal object.- Modularity of termination and confluence in combinations of rewrite systems with ??.- From domains to automata with concurrency.- What is a universal higher-order programming language?.

Du kanske också är intresserad av

Algorithm Theory - SWAT '96

Rolf Karlsson, Andrzej Lingas

Häftad, 1996

749 kr

SWAT '88

Rolf Karlsson, Andrzej Lingas

Häftad, 1988

729 kr

Del 114

Proto Witotoan

Richard P Aschmann

Häftad, 1993

459 kr

Principles Of Social Psychology

Nicky Hayes

Häftad, 1993

809 kr

Advances in Databases

Michael F. Worboys, Anna F. Grundy

Häftad, 1993

749 kr

Del 50

Satellite Altimetry in Geodesy and Oceanography

Reiner Rummel, Fernando Sansò

Häftad, 1993

729 kr

Ways of Escape

C. Rojek

Häftad, 1993

729 kr

Cocaine and Crack

Philip Bean

Häftad, 1993

729 kr

From Peasant to Entrepreneur

Anna Bull, Anna Cento Bull, A. Bull, Paul Corner, Anna Bull

Inbunden, 1993

2 239 kr

Concepts in Fetal Movement Research

Joyce W Sparling, Joyce W Sparling

Inbunden, 1993

839 kr

Del i serien Lecture Notes in Computer Science

Automata, Languages and Programming

20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings

Häftad, Engelska, 1993

AvAndrzej Lingas,Rolf Karlsson,Svante Carlsson

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1993-06-23
Mått155 x 233 x 39 mm
Vikt1 066 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor703
Upplaga1993
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540569398

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Program result checking: A new approach to making programs more reliable.- Dynamic interpolation search in o(log log n) time.- Searching among intervals and compact routing tables.- The approximation of maximum subgraph problems.- Polynomially bounded minimization problems which are hard to approximate.- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover.- The complexity of approximating PSPACE-complete problems for hierarchical specifications.- Problems on pairs of trees and the four colour problem of planar graphs.- Constructing competitive tours from local information.- Treewidth and pathwidth of permutation graphs.- A theory of even functionals and their algorithmic applications.- Exact asymptotics of divide-and-conquer recurrences.- Optimal bounds for the change-making problem.- The complexity of N-body simulation.- A simple method for resolving degeneracies in Delaunay triangulations.- Fault-tolerance and complexity (Extended abstract).- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines.- On the computational power of discrete Hopfield nets.- On randomized versus deterministic computation.- Lower bounds for one-way probabilistic communication complexity.- Maintaining discrete probability distributions optimally.- Secure and efficient off-line digital money (extended abstract).- Computational depth and reducibility.- Learnability: Admissible, co-finite, and hypersimple languages.- Inclusion is undecidable for pattern languages.- New decidability results concerning two-way counter machines and applications.- Cobham's Theorem seen through Büchi's Theorem.- Logical definability on infinite traces.- Algebras for classifying regular tree languages and anapplication to frontier testability.- Finite automata as characterizations of minor closed tree families (extended abstract).- On distributed algorithms in a broadcast domain.- Sparse networks supporting efficient reliable broadcasting.- Strongly adaptive token distribution.- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic.- Fast parallel constraint satisfaction.- The product of rational languages.- On regular compatibility of semi-commutations.- Algebraic aspects of B-regular series.- Products of finite state machines with full coverage.- An effective version of Stallings' theorem in the case of context-free groups.- On the power of periodic iteration of morphisms.- If a DOL language is k-power free then it is circular.- Deciding true concurrency equivalences on finite safe nets (preliminary report).- Timed testing of concurrent systems.- The fork calculus.- Extended transition systems for parametric bisimulation.- Temporal logic and categories of Petri nets.- Decidability of a partial order based temporal logic.- Local model checking for context-free processes.- Computing on structures.- A partial solution for D-unification based on a reduction to AC 1-unification.- Efficient analysis of concurrent constraint logic programs.- A confluent reduction for the extensional typed ?-calculus with pairs, sums, recursion and terminal object.- Modularity of termination and confluence in combinations of rewrite systems with ??.- From domains to automata with concurrency.- What is a universal higher-order programming language?.