Automata, languages, and programming : 12th colloquium, Nafplion, Greece, July 15-19, 1985
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
194 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata, languages, and programming, 12th colloquium, Nafplion, Greece, July 15-19, 1985, edited by Wilfried Brauer, Berlin, Springer-Verlag, 1985, 1 vol. (VII-519 p.), Lecture notes in computer science, 0-387-15650-X • Automata, Languages and Programming, Texte imprimé, 9783662181164 |
Inhaltsangabe:
- Vertex packing algorithms
- Linear and branching structures in the semantics and logics of reactive systems
- About rational sets of factors of a bi-infinite word
- A fair protocol for signing contracts
- The influence of key length on the area-time complexity of sorting
- Repeated synchronous snapshots and their implementation in CSP
- On total regulators generated by derivation relations
- Optimal solutions for a class of point retrieval problems
- Fractional cascading: A data structuring technique with geometric applications
- Hierarchies of one-way multihead automata languages
- Partitioning point sets in 4 dimensions
- A completeness theorem for recursively defined types
- Categorical combinatory logic
- Towards a uniform topological treatment of streams and functions on streams
- Infinite streams and finite observations in the semantics of uniform concurrency
- Imposed-functional dependencies inducing horizontal decompositions
- Characterization of high level tree transducers
- Ambiguity and transcendence
- A fast algorithm for polygon containment by translation
- Deterministic and Las Vegas primality testing algorithms
- Efficient algorithms for graphic matroid intersection and parity
- Operational semantics for order-sorted algebra
- A universal domain technique for profinite posets
- A simple proof of the Skolem-Mahler-Lech theorem
- On complete problems for NP?CoNP
- An algebraic theory of fair asynchronous communicating processes
- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem
- Powerdomains as algebraic lattices preliminary report
- Random generation of combinatiorial structures from a uniform distribution
- Do rational equivalence relations have regular cross-sections?
- On probabilistic time and space
- Thenearest neighbor problem on bounded domains
- Routing through a generalized switchbox
- On k-repetition free words generated by length uniform morphisms over a binary alphabet
- Every commutative quasirational language is regular
- A probabilistic distributed algorithm for set intersection and its analysis
- Distributed algorithms in synchronous broadcasting networks
- A context dependent equivalence between processes
- Lower bounds by kolmogorov-complexity
- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version)
- Applications of an infinite squarefree CO-CFL
- Special relations in automated deduction
- Dynamic interpolation search
- Polynomial levelability and maximal complexity cores
- Finite group topology and p-adic topology for free monoids
- On the use of relational expressions in the design of efficient algorithms
- The complementation problem for Büchi automata with applications to temporal logic
- A complete compositional modal proof system for a subset of CCS
- On matrix multiplication using array processors
- Optimal parallel pattern matching in strings
- Compositionality and concurrent networks: Soundness and completeness of a proofsystem.