Mathematical foundations of computer science 1992 : 17th International Symposium, Prague, Czechoslovakia, August 24 28, 1992 : proceedings
This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia s...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
629 |
| Matèries: | |
| Accés en línia: | 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 1992, proceedings, 17th International symposium, Prague, Czechoslovakia, August 24-28, 1992, I. M. Havel, V. Koubek (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (IX-521 p.), Lecture notes in computer science, 3-540-55808-X • Mathematical Foundations of Computer Science 1992, Texte imprimé, 9783662194454 |
Taula de continguts:
- On range searching with semialgebraic sets
- Graph layout problems
- Parallel recognition and ranking of context-free languages
- On the expansion of combinatorial polytopes
- Neural networks and complexity theory
- Theory of computation over stream algebras, and its applications
- Methods in parallel algorithmcs
- On the complexity of small description and related topics
- Weak parallel machines: A new class of physically feasible parallel machine models
- The complexity of graph connectivity
- A perfect parallel dictionary
- Some remarks on the test complexity of iterative logic arrays
- The degree structure of 1-L reductions
- Promise problems and access to unambiguous computation
- On the complexity of incremental computation
- Rational transductions and complexity of counting problems
- Negation elimination in equational formulae
- Object interaction
- Strong normalization of substitutions
- Probabilistic and pluralistic learners with mind changes
- Parallel complexity of iterated morphisms and the arithmetic of small numbers
- On computational power of weighted finite automata
- The shuffle exchange network has a Hamiltonian path
- Poset properties of complex traces
- A threshold for unsatisfiability
- Dataflow semantics for Petri nets
- About boundedness for some datalog and DATALOGneg programs
- Merging and sorting strings in parallel
- Characterization of context-pree languages by erasing automata
- Insertion and deletion of words: Determinism and reversibility
- Small universal one-state linear operator algorithm
- Mobility in the CC-paradigm
- The emptiness problem for intersections of regular languages
- On finite automata with limited nondeterminism (extended abstract)
- Definitions and comparisons of local computations on graphs
- Efficient unidimensionaluniversal cellular automaton
- Inferring a tree from walks
- Almost every set in exponential time is P-bi-immune
- A functorial semantics for observed concurrency
- Modelling concurrency with semi-commutations
- Decision problems for cellular automata and their semigroups
- On the nature of events
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
- Two simple characterizations of well-founded semantics
- Fully abstract semantics for higher order communicating systems
- Superposable Trellis Automata
- Maintaining proximity in higher dimensional spaces
- Characterizing regular languages with polynomial densities
- A strategy for speeding-up the computation of characteristic sets
- One-rule trace-rewriting systems and confluence.