Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings : FST and TCS 11
This volume contains the proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science held in New Dehli, India December 17-19, 1991. Three invited papers and 25 contributed papers selected from 78 submissions by authors from many different countries r...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
560 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software technology and theoretical computer science, 11th conference, New Delhi, India, December 17-19, 1991, proceedings, S. Biswas, K.V. Nori (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (X-419 p.), Lecture notes in computer science, 3-540-54967-6 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662210451 |
Spis treści:
- Program checking
- Randomizing reductions of search problems
- Time analysis, cost equivalence and program refinement
- AC-equation solving
- On the operational interpretation of complex types
- Tense logics for local reasoning in distributed systems
- Failures semantics for a simple process language with refinement
- Correctness of programs over poor signatures
- Complexity issues for vacillatory function identification
- A purely algebraic proof of McNaughton's theorem on infinite words
- The structure and complexity of minimal NFA's over a unary alphabet
- Relativised cellular automata and complexity classes
- Computing the order of a locally testable automaton
- On the structure and complexity of infinite sets with minimal perfect hash functions
- NP-hard sets and creativeness over constant time languages
- Complete problems involving boolean labelled structures and projection translations
- Is BP.?