Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | On Sub Regular 0L Forms | Albert, J., Maurer, H.A., Ottmann, Th. | 1981 | |||
Article | Insertion and deletion closure of languages | Ito, M., Kari, L., Thierrin, G. | ||||
Article | Data types over multiple-valued logics | Pigozzi, D. | 1990 | |||
Article | Parallel parsing on the connection machine | Skillicorn, D.B., Barnard, D.T. | 1989 | |||
Article | Equality-test and if-then-else algebras: axiomatization and specification | Pigozzi, D. | 1991 | |||
Article | Graph-controlled grammars as language acceptors | Fernau, H. | 1997 | |||
Article | Image Theorems for Simple Matrix Languages and n-Parallel Languages | Rosebrugh, R.D., Wood, D. | 1974 | |||
Article | Undecidability of the equivalence of finite substitutions on regular language | Halava, H., Harju, T. | 1998 | |||
Article | A note on Lindenmayer Systems, Szilard Languages, Spectra, and Equivalence | Wood, D. | 1975 | |||
Article | Jazyky a prekladace | Melichar, B. | 2003 | |||
Article | A note on programmed 0L systems | Dassow, J. | 1983 | |||
Article | A sentence generator for testing parsers | Purdom, P. | 1972 | |||
Article | Succintness of descriptions of context-free, regular, and finite languages | Schmidt, E.M. | 1978 | |||
Article | Inauguracni prednaska ke jmenovani profesorem | Szendiuch, I. | 1999 | |||
Article | On semi-conditional grammars with productions having either forbidding or permitting conditions | Meduna, A., Gopalaratnam, A. | 1994 | |||
Article | Formalni pristup k analyze testovatelnosti cislicovych obvodu na urovni RT | Ruzicka, R. | ||||
Article | On cooperating/distributed grammar systems | Csuhaj-Varju, E., Dassow, J. | 1990 | |||
Article | Wachsende kontextsensitive sprachen | Buntock, G. | 1996 | |||
Article | The VLDB Journal 10/2--3 | 2001 | ||||
Article | Context-free graph languages of bounded degree are generated by apex graph grammars | Engelfriet, J., Heyker, L., Leih, G. | 1994 | |||
Article | Rice's theorem for the limit sets of cellular automata | Kari, J. | 1994 | |||
Article | Context-free hypergraph grammars have the same term-generating power as attribute grammars | Engelfriet, J., Heyker, L. | 1992 | |||
Article | The translation power of top-down tree-to-graph transducers | Engelfriet, J., Vogler, H. | 1994 | |||
Article | On representing recursively enumerable languages by internal contextual langauges | Ehrenfeucht, A., Paun, G., Rozenberg, G. | 1994 | |||
Article | On parsing arithmetic expressions in a multiprocessing environment | Baccelli, F., Fleury, T. | 1982 | |||
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 |