17 Titel in Besondere Sammlungen → Veröffentlichungen der Universität → Fakultät für Elektrotechnik, Informatik und Mathematik → Institut für InformatikKlassifikationSchliessenFilter1
zu den Filteroptionen17 Titel in Besondere Sammlungen → Veröffentlichungen der Universität → Fakultät für Elektrotechnik, Informatik und Mathematik → Institut für Informatik
Klassifikation
Schliessen
Filter
1
About the derivation languages of grammars and machines
Monien, BurkhardIn: Automata, languages and programming, Jg. 4.1977, S. 337-351The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
Monien, BurkhardIn: SIAM journal on algebraic and discrete methods, Jg. 7.1986 H. 4, S. 505-512Characterizations of time-bounded computations by limited primitive recursion
Monien, BurkhardIn: Automata, languages and programming, Jg. 2.1974, S. 280-293The complexity of embedding graphs into binary trees
Monien, BurkhardIn: Fundamentals of computation theory, Jg. 5, S. 300-309Deterministic two-way one-head pushdown automata are very powerful
Monien, BurkhardIn: Information processing letters, Jg. 18.1984, S. 239-242How to find long paths efficiently
Monien, BurkhardIn: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
Monien, BurkhardIn: Acta Informatica, Jg. 8.1977, S. 371-382On a subclass of pseudopolynomial problems
Monien, BurkhardIn: Mathematical Foundations of Computer Science, Jg. 9, S. 414-425A recursive and a grammatical characterization of the exponential-time languages
Monien, BurkhardIn: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-74Relationships between pushdown automata and tape-bounded turing machines
Monien, BurkhardIn: Automata, languages and programming, Jg. 1973, S. 575-583Relationships between pushdown automata with counters and complexity classes
Monien, BurkhardIn: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-264Simulating binary trees on x-trees
Monien, BurkhardIn: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, S. 147-158Transformational methods and their application to complexity problems
Monien, BurkhardIn: Acta Informatica, Jg. 6.1976, S. 95-108Two-way multihead automata over a one-letter alphabet
Monien, BurkhardIn: R.A.I.R.O Informatique théorique, Jg. 14.1980, S. 67-82