Mathematical foundations of computer science 1981 : proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
118 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 1981, proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981, edited by J. Gruska and M. Chytil, Berlin, Springer-Verlag, 1981, 1 vol. (XI-589 p.), Lecture notes in computer science, 0-387-10856-4 • Mathematical Foundations of Computer Science 1981, Texte imprimé, 9783662209301 |
Tabla de Contenidos:
- The complexity of manipulating hierarchically defined sets of rectangles
- The transformational machine: Theme and variations
- Probabilistic two-way machines
- A survey of some recent results on computational complexity in weak theories of arithmetic
- A survey on oracle techniques
- Time and space bounded complexity classes and bandwidth constrained problems
- Representations of graphs by means of products and their complexity
- Parsing strategies: A concise survey
- The art of dynamizing
- Fast parallel computation of polynomials using few processors
- Generalizations of Petri nets
- Partial match retrieval in implicit data structures
- A characterization of Floyd-provable programs
- Semantics of CSP via translation into CCS
- More about the "geography" of context-free languages
- On the power of algebraic specifications
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- On the complexity of word problems in certain Thue systems
- On the transformation of derivation graphs to derivation trees
- Pushdown automata with restricted use of storage symbols
- Structured nets
- Retraceability, repleteness and busy beaver sets
- Combining T and level-N
- On realization and implementation
- Multiplicative complexity of a bilinear form over a commutative ring
- Making dynamic logic first-order
- Partial interpretations of program schemata
- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata
- Another hierarchy defined by multihead finite automata
- An extension of Rabin's complete proof concept
- How to find invariants for coloured Petri nets
- Relationships between probabilistic and deterministic tape complexity
- Grammatical levels of the position restricted grammars
- A general framework for comparing sequential and parallel rewriting
- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit
- Codings of nonnegative integers
- The maximum k-flow in a network
- On the constructive description of graph languages accepted by finite automata
- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries
- Maximum flow in planar networks
- Probabilistic combinatorial optimization
- Time-processor trade-offs for universal parallel computers
- Negative results on the size of deterministic right parsers
- Key-equivalence of functional dependency statements systems
- On representation of dynamic algebras with reversion
- A framework for studying grammars
- On existence of complete predicate calculus in metamathematics without exponentiation
- On structural similarity of context-free grammars
- Axioms for the term-wise correctness of programs
- Complexity and entropy
- Axiomatic semantics of indirect addressing
- Testing of join dependency preserving by a modified chase method
- A starvation-free solution of the dining philosophers' problem by use of interaction systems
- Admissible representations of effective cpo's
- Preserving total order in constant expected time
- Constructive category theory (No. 1)
- Two pebbles don't suffice.