The Resource Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)
Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)
Resource Information
The item Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary

 This book constitutes the refereed proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98, held in Aalborg, Denmark, in July 1998. The 70 revised full papers presented together with eight invited contributions were carefully selected from a total of 182 submissions. The book is divided in topical sections on complexitiy, verification, data structures, concurrency, computational geometry, automata and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, picalculus, automata and BSP, rewriting, networking and routing, zeroknowledge, quantum computing, etc
 Annotation:
 Language
 eng
 Extent
 XXXII, 936 pages
 Contents

 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations {u2014} on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations ? on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Isbn
 9783540686811
 Label
 Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings
 Title
 Automata, Languages and Programming
 Title remainder
 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings
 Statement of responsibility
 edited by Kim G. Larsen, Sven Skyum, Glynn Winskel
 Subject

 Computer Science
 Data Structures
 Computer Graphics
 Computer graphics
 Computer science
 Information theory
 Formal Languages
 Computer Programming
 Artificial intelligence
 Machine Theory
 Computer Communication Networks
 Data structures (Computer science)
 Theory of Computation
 Artificial Intelligence (incl. Robotics)
 Language
 eng
 Summary

 This book constitutes the refereed proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98, held in Aalborg, Denmark, in July 1998. The 70 revised full papers presented together with eight invited contributions were carefully selected from a total of 182 submissions. The book is divided in topical sections on complexitiy, verification, data structures, concurrency, computational geometry, automata and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, picalculus, automata and BSP, rewriting, networking and routing, zeroknowledge, quantum computing, etc
 Annotation:
 Dewey number
 004.0151
 LC call number
 QA75.576.95
 http://library.link/vocab/relatedWorkOrContributorName

 Larsen, Kim G
 Skyum, Sven
 Winskel, Glynn
 SpringerLink (Online service)
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 1443
 http://library.link/vocab/subjectName

 Computer science
 Computer Communication Networks
 Data structures (Computer science)
 Information theory
 Artificial intelligence
 Computer graphics
 Computer Science
 Theory of Computation
 Data Structures
 Computer Graphics
 Computer Communication Networks
 Artificial Intelligence (incl. Robotics)
 Summary expansion
 This book constitutes the refereed proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98, held in Aalborg, Denmark, in July 1998.The 70 revised full papers presented together with eight invited contributions were carefully selected from a total of 182 submissions. The book is divided in topical sections on complexitiy, verification, data structures, concurrency, computational geometry, automata and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, picalculus, automata and BSP, rewriting, networking and routing, zeroknowledge, quantum computing, etc.
 Label
 Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)
 Contents

 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations {u2014} on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations ? on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Control code
 OCM1bookssj0000321520
 Dimensions
 unknown
 Extent
 XXXII, 936 pages
 Isbn
 9783540686811
 Other control number
 10.1007/BFb0055035
 Other physical details
 online resource.
 Specific material designation
 remote
 System control number
 (WaSeSS)ssj0000321520
 Label
 Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)
 Contents

 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations {u2014} on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Algorithmic verification of linear temporal logic specifications  On existentially firstorder definable languages and their relation to NP  An algebraic approach to communication complexity  Deciding global partialorder properties  Simple lineartime algorithms for minimal fixed points  Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method  Simpler and faster dictionaries on the AC0 RAM  Partialcongruence factorization of bisimilarity induced by open maps  Reset nets between decidability and undecidability  Geometric algorithms for robotic manipulation  Compact encodings of planar graphs via canonical orderings and multiple parentheses  Reducing simple polygons to triangles  A proof for an improved conjecture   Difficult configurations ? on the complexity of LTrL  On the expressiveness of real and integer arithmetic automata  Distributed matroid basis completion via elimination upcast and distributed correction of minimumweight spanning trees  Independent sets with domination constraints  Robust asynchronous protocols are finitestate  Deciding bisimulationlike equivalences with finitestate processes  Do probabilistic algorithms outperform deterministic ones?  A degreedecreasing Lemma for (MOD q, MOD p) circuits  Improved pseudorandom generators for combinatorial rectangles  Translation validation for synchronous languages  An efficient and unified approach to the decidability of equivalence of propositional programs  On branching programs with bounded uncertainty  CONSfree programs with tree input  Concatenable graph processes: Relating processes and derivation traces  Axioms for contextual net processes  Existential types: Logical relations and operational equivalence  Optimal sampling strategies in quicksort  A genuinely polynomialtime algorithm for sampling tworowed contingency tables  A modular approach to denotational semantics  Generalised flowcharts and games  Efficient minimization of numerical summation errors  Efficient approximation algorithms for the subsetsums equality problem  Structural recursive definitions in type theory  A good class of tree automata. Application to inductive theorem proving  Locally periodic infinite words and a chaotic behaviour  Bridges for concatenation hierarchies  Complete proof systems for observation congruences in finitecontrol ?calculus  Concurrent constraints in the fusion calculus  On computing the entropy of cellular automata  On the determinization of weighted finite automata  Bulksynchronous parallel multiplication of boolean matrices  A complex example of a simplifying rewrite system  On a duality between Kruskal and Dershowitz theorems  A total ACcompatible reduction ordering on higherorder terms  Model checking game properties of multiagent systems  Limited wavelength conversion in alloptical tree networks  Computing mimicking networks  Metric semantics for true concurrent real time  The regular realtime languages  Static and dynamic lowcongested interval routing schemes  Lowbandwidth routing and electrical power networks  Constraint automata and the complexity of recursive subtype entailment  Reasoning about the past with twoway automata  A neuroidal architecture for cognitive computation  Deterministic polylog approximation for minimum communication spanning trees  A polynomial time approximation scheme for euclidean minimum cost kconnectivity  Global/local subtyping and capability inference for a distributed ?calculus  Checking strong/Weak bisimulation equivalences and observation congruence for the ?calculus  Inversion of circulant matrices over Zm  Application of LempelZiv encodings to the solution of word equations  Explicit substitutitions for constructive necessity  The relevance of proofirrelevance  New horizons in quantum information processing  Sequential iteration of interactive arguments and an efficient zeroknowledge argument for NP  Image density is complete for noninteractiveSZK  Randomness spaces  Totality, definability and boolean circuits  Quantum counting  On the complexity of deriving score functions from examples for problems in molecular biology  A hierarchy of equivalences for asynchronous calculi  On asynchrony in namepassing calculi  Protection in programminglanguage translations  Efficient simulations by queue machines  Power of cooperation and multihead finite systems  A simple solution to type specialization  Multistage programming: axiomatization and type safety
 Control code
 OCM1bookssj0000321520
 Dimensions
 unknown
 Extent
 XXXII, 936 pages
 Isbn
 9783540686811
 Other control number
 10.1007/BFb0055035
 Other physical details
 online resource.
 Specific material designation
 remote
 System control number
 (WaSeSS)ssj0000321520
Subject
 Artificial Intelligence (incl. Robotics)
 Artificial intelligence
 Computer Communication Networks
 Computer Graphics
 Computer Programming
 Computer Science
 Computer graphics
 Computer science
 Data Structures
 Data structures (Computer science)
 Formal Languages
 Information theory
 Machine Theory
 Theory of Computation
Member of
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming25th/r6obue7J4wI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming25th/r6obue7J4wI/">Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming25th/r6obue7J4wI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AutomataLanguagesandProgramming25th/r6obue7J4wI/">Automata, Languages and Programming : 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13{u2013}17, 1998 Proceedings, edited by Kim G. Larsen, Sven Skyum, Glynn Winskel, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>