15 Titles in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke 2
jump to filter-options15 Titles in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke
2
- All Titles
- Klassifikation (DDC)
- Informatik, Informationswissenschaft, allgemeine Werke
- Informatik, Wissen, Systeme
- Bibliografien
- Bibliotheks- und Informationswissenschaften
- Enzyklopädien, Faktenbücher
- Zeitschriften, fortlaufende Sammelwerke
- Verbände, Organisationen, Museen
- Publizistische Medien, Journalismus, Verlagswesen
- Allgemeine Sammelwerke, Zitatensammlungen
- Handschriften, seltene Bücher
About the derivation languages of grammars and machines
In: Automata, languages and programming, Vol. 4.1977, page 337-3512009
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
In: SIAM journal on algebraic and discrete methods, Vol. 7.1986 Issue 4, page 505-5122009
Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Vol. 2.1974, page 280-2932009
The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Vol. 5, page 300-3092009
Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Vol. 18.1984, page 239-2422009
How to find long paths efficiently
In: Annals of Discrete Mathematics, Vol. 25.1985, page 239-2542009
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Vol. 8.1977, page 371-3822009
On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Vol. 9, page 414-4252009
A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Vol. 3.1976 Issue 3, page 61-742009
Relationships between pushdown automata and tape-bounded turing machines
In: Automata, languages and programming, Vol. 1973, page 575-5832009
Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Vol. 9.1975 Issue No. 3, page 248-2642009

Simulating binary trees on x-trees
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, page 147-1582009
Transformational methods and their application to complexity problems
In: Acta Informatica, Vol. 6.1976, page 95-1082009
Two-way multihead automata over a one-letter alphabet
In: R.A.I.R.O Informatique théorique, Vol. 14.1980, page 67-822009
