Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | Machine characterization of (E0L-E0L) array languages | Nirmal, N., Rama, R. | 1991 | |||
Article | On the degree of non-regularity of context-free languages | Dassow, J., Paun, Gh. | 1989 | |||
Article | Outfix and Infix codes and related classes of languages | Ito, M., Jurgensen, H., Shyr, H.J., Thierring, G. | 1991 | |||
Article | Comparison of some types of regulated rewriting | Dassow, J. | 1983 | |||
Article | Overlaps in free partially commutative monoids | Otto, F., Wrathall, C. | 1991 | |||
Article | A characterization of set representable labeled partial 2-structures through decompositions | Ehrenfeucht, A., Rozenberg, G. | 1990 | |||
Article | The generative capacity of the compound grammars | Paun, Gh. | 1977 | |||
Article | Langford strings, formal languages and contextual ambiguity | Marcus, S., Paun, Gh. | 1989 | |||
Article | Nondeterministic logspace reductions | Lange, K.-J. | ||||
Article | Jedna metoda kompilatorove orientovane syntakticke analyzy se strategii temer shora dolu | Demner, J. | 1974 | |||
Article | Bottom up versus top down syntax analysis revised. Semitop-down transition diagrams driven syntax analysis. | Kral, J. | 1974 | |||
Article | Semi-top-down syntactic analysis | Kral, J., Demner, J. | 1973 | |||
Article | Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata | Kintala, C.M.R., Wotschke, D. | 1985 | |||
Article | Operators reducing generalized 0L-systems | Novotny, M. | ||||
Article | A super normal form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | 1980 | |||
Article | Succintness of descriptions of unambiguous context-free languages | Schmidt, E.M. | 1976 | |||
Article | Transductions and the parallel generation of languages | Culik II, K., Head, T. | 1981 | |||
Article | Weiterfuhrende arbeiten am COMPANET-Compiler: Realisierung der verdeckten Interrechner-Kommunikation im COPANET | Nebel, B. | 1971 | |||
Article | The decidability of the equivalence problem for D0L-systems | Culik II, K., Fris, I. | 1976 | |||
Article | Generative models for parallel processes | Rozenberg, G., Wood, D. | 1973 | |||
Article | Uber einige eigenschaften der zerlugungsubersetzung | Kopriva, J. | 1980 | |||
Article | Compilers | Meduna, A. | 1991 | |||
Article | Sample answers to some exercises in elementary computability, formal languages, and automata | McNaughton, R. | 1994 | |||
Article | The ultimate equivalence of iterated homomorphisms is recursively unsolvable | Karpinski, M. | 1980 | |||
Article | A logical theory of robot problem solving | Stepankova, O., Havel, I.M. | 1975 | |||
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 |