Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | A grammar-theoretic treatment of multiagent systems | Kelemen, J., Kelemenova, A. | 1992 | |||
Article | Rational algebraic theories and fixed-point solutions | Wright, J.B., Thatcher, J.W., Wagner, E.G. | 1976 | |||
Article | Programming languages as mathematical objects | Wagner, E.G., Thetcher, J.W., Wright, J.B. | 1978 | |||
Article | Pyramids: a data type for matrix representation in pascal | Solntseff, N., Wood, D. | 1977 | |||
Article | An empirical study of list structure in lisp | Clark, D.W. | 1977 | |||
Article | Zakladni pojmy teorie programovych schemat I. | Horejs, J. | 1974 | |||
Article | Theory of program schemata | Ershov, A.P. | ||||
Article | Adding global forbidding context to context-free grammars | Ehrenfeucht, A., Kleijn, H.C.M., Rozenberg, G. | 1984 | |||
Article | Uber einige eigenschaften der zerlugungsubersetzung | Kopriva, J. | 1976 | |||
Article | The weak generative capacity of parenthesis-free categorial grammars | Friedman, J., Dai, D., Wang, W. | 1986 | |||
Article | Categorial and non-categorial languages | Friedman, J. | 1986 | |||
Article | Rewriting systems with limited distance permitting context | von Solms, S.H. | 1980 | |||
Article | Splicing semigroups of dominoes and DNA | Culik II, K., Harju, T. | ||||
Article | Recognizable closures and submonoids of free partially commutative monoids | Hashiguchi, K. | 1991 | |||
Article | Finitary and infinitary interpretations of languages | Maurer, H.A., Salomaa, A., Wood, D. | 1982 | |||
Article | Ambiguous translation grammars | Share, M. | 1988 | |||
Article | Efficient algorithms for tree reconstruction | Slough, W., Efe, K. | ||||
Article | Systolicke vypocty a automaty | Gruska, J. | 1982 | |||
Article | A note on exponential density of ET0L languages | Meduna, A. | 1986 | |||
Article | Generalized forbidding grammars | Meduna, A. | 1990 | |||
Article | The string generating power of context-free hypergraph grammars | Engelfriet, J., Heyker, L. | 1991 | |||
Article | Kontextfrei kontrollierte ET0L-systeme | Lange, K.-J. | 1983 | |||
Article | On the equivalence and containment problems for unambiguous regular expressinos, regular grammars, and fintite automata | Stearns, R.E., Hunt, H.B. | 1983 | |||
Article | ET0L forms | Maurer, H.A., Salomaa, A., Wood, D. | 1976 | |||
Article | Decidability of sequence equivalence for quasi-simple D0L-systems and all systems over two letters | Culik II, K., Fris, I. | 1976 | |||
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 |