Automata, Languages and Programming
Springer Berlin (Verlag)
978-3-540-56939-8 (ISBN)
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?.
| Erscheint lt. Verlag | 23.6.1993 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XIII, 703 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 883 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | Algorithm analysis and problem complexity • Algorithmen • algorithms • Algorithmus • Automat • Automata • Automaten • Automatentheorie • Complexity • Computer Science • data structure • data structures • Formale Sprache • formale Sprachen • formal language • Formal Languages • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Mathematical Logic • Mathematische Logik • Programmieren • Programmierung • programming • Programming language • robot • Robotics • Semantics • Term Rewriting • verification |
| ISBN-10 | 3-540-56939-1 / 3540569391 |
| ISBN-13 | 978-3-540-56939-8 / 9783540569398 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
