Theoretical computer science : 5th GI-conference, Karlsruhe, March 23 25, 1981
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
104 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theoretical computer science, 5th GI-conference, Karlsruhe, March 23-25, 1981, Berlin, Springer-Verlag, 1981, 1 vol. (VII-260 p.), Lecture notes in computer science, 3-540-10576-X • Theoretical Computer Science, Texte imprimé, 9783662175682 |
Table des matières:
- On the subword complexity and square-freeness of formal languages
- Cycle-free IN-algebraic systems
- On the height of syntactical graphs
- Boolean functions whose monotone complexity is of size n2/log n
- Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung)
- The computational complexity of bilinear multiplications
- P complete problems in free groups
- Quelques proprietes des langages a un Compteur
- Un resultat de discontinuite dans les familles de langages
- Verallgemeinerte kommutative Sprachen
- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen
- Un analogue du theoreme des varietes pour les cones et les cylindres
- A family of graphs with expensive depth-reduction
- On ?-balanced binary search trees
- Erzeugung optimalen Codes für Series Parallel Graphs
- Recent directions in algorithmic research
- Dynamic k-dimensional multiway search under time-varying access frequencies
- Some applications of CFL's over infinite alphabets
- A decidable property of iterated morphisms
- Prefix-preservation for rational partial functions is decidable
- Concurrency and automata on infinite sequences
- An effective retract calculus
- Recursion and complexity theory on CPO-S
- Computable algebras, word problems and canonical term algebras
- Reachability analysis with assertion systems
- Dynamization of decomposable searching problems yielding good worst-case bounds
- Robust balancing in B-trees
- Centers of languages
- (Erasing)* strings.