Machines, languages, and complexity : 5th International meeting of young computer scientists, Smolenice, Czechoslovakia, November 14-18, 1988 : selected contributions
The volume contains selected contributions from the scientific programme of the 5th International Meeting of Young Computer Scientists (IMYCS '88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contem...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
381 |
| Soggetti: | |
| Accesso 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 |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Machines, languages, and complexity, selected contributions, 5th International meeting of young computer scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Berlin, Springer-Verlagr, 1989, 1 vol. (VI-244 p.), Lecture notes in computer science, 3-540-51516-X • Machines, Languages, and Complexity, Texte imprimé, 9783662172100 |
Sommario:
- Questions of decidability for context-free chain code picture languages
- Chomsky hierarchy and communication complexity
- Complexity theory and formal languages
- Rational cones and commutations
- A remark on some classifications of Indian parallel languages
- An extension of the Krohn-Rhodes decomposition of automata
- A survey of two-dimensional automata theory
- The simulation of two-dimensional one-marker automata by three-way turing machines
- Some properties of space-bounded synchronized alternating turing machines with only universal states
- The virtual floating grid file
- A partially persistent data structure for the set-union problem with backtracking
- A note on the computational complexity of bracketing and related problems
- Postorder hierarchy for path compressions and set union
- The convex hull problem on grids computational and combinatorial aspects
- The riches of rectangles
- The limitations of partial evaluation
- Algorithmic learning from incomplete information: Principles and problems
- A cryptosystem based on propositional logic
- Tutorial: Cryptography and data security.