Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | Invariants of inversive 2-structures on groups of labels | Ehrenfeucht, A., Harju, T., Rozenberg, G. | 1994 | |||
Article | Homomorphisms: Decidability, Equality and Test Sets | Culik II, K. | 1980 | |||
Article | Soliton automata | Dassow, J., Jurgensen, H. | 1990 | |||
Article | Checking Sets, Test Sets, Rich Languages and Commutative-Closed Languages | Albert, J., Wood, D. | 1982 | |||
Article | One abstract accepting algorithm for all kinds of parsers | Deussen, P. | ||||
Article | Iterative Tree Automata | Culik II, K., Yu, S. | 1984 | |||
Article | The equivalence of four extensions of context-free grammars | Vijay-Shanker, K., Weir, D.J. | 1992 | |||
Article | Time-delayed 0L languages and sequences | Wood, D. | 1974 | |||
Article | Overlaps in free partially commutative monoids | Otto, F., Wrathall, C. | 1991 | |||
Article | Simple Deterministic Langauges | Korenjak, A.J., Hopcroft, J.E. | 1966 | |||
Article | On the transition graphs of automata and grammars | Caucal, D., Monfort, R. | 1990 | |||
Article | An approach to a unified theory of grammar and L forms | Vaishnavi, V.K., Wood, D. | 1978 | |||
Article | Caterpillars and context-free languages | Chytil, M.P., Monien, B. | 1988 | |||
Article | Six-nonterminal multi-sequential grammars characterize the family of recursively enumerable languages | Meduna, A. | ||||
Article | Languages and scanners | Beauquier, D., Pin, J.-E. | 1991 | |||
Article | Constantly growing generation of context-sensitive languages and its simulation by scattered context grammars | Meduna, A. | ||||
Article | Deterministic soliton automata with a single exterior node | Dassow, J., Jurgensen, H. | 1991 | |||
Article | Efficient algorithm for automatic construction and compactification of parsing grammars | Rosenkrantz, D.J., Hunt, H.B. | 1982 | |||
Article | Folding of the plane and the design of systolic arrays | Choffrut, C., Culik II, K. | 1983 | |||
Article | The complexity of monadic recursion schemes: exponential time bounds | Hunt, H.B., Rosenkrantz, D.J. | 1983 | |||
Article | On the connectedness of pictures in chain code pisture languages | Dassow, J. | 1991 | |||
Article | Generalised time-delayed 0L languages | Wood, D. | 1976 | |||
Article | On commutative Kleene monoids | Rupert, C.P. | 1991 | |||
Article | Doubly deterministic tabled 0L systems | Culik II, K., Wood, D. | 1977 | |||
Article | A note on one-way and two-way automata | Hartmanis, J. | 1970 | |||
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 |