Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | On commutative Kleene monoids | Rupert, C.P. | 1991 | |||
Article | Global context conditional grammars | Meduna, A. | 1991 | |||
Article | Languages and scanners | Beauquier, D., Pin, J.-E. | 1991 | |||
Article | Recognizable closures and submonoids of free partially commutative monoids | Hashiguchi, K. | 1991 | |||
Article | Fundamenta Informaticae, Volume XIV, Number 4 | Rasiowa, H. | 1991 | |||
Article | The string generating power of context-free hypergraph grammars | Engelfriet, J., Heyker, L. | 1991 | |||
Article | Global context conditional grammars | Meduna, A. | 1991 | |||
Article | Equality-test and if-then-else algebras: axiomatization and specification | Pigozzi, D. | 1991 | |||
Article | An annotated bibliography on parallel parsing | de Vreught, J.P.M. | 1991 | |||
Article | Graph grammars with path-controlled embedding | Aizawa, K., Nakamura, A. | 1991 | |||
Article | A deterministic algorithm for modular knapsack problems | Salomaa, A. | 1991 | |||
Article | Many aspects of formal languages | Salomaa, A. | 1991 | |||
Article | On bounded interpretations of grammar forms | Csuhaj-Varju, E., Dassow, J. | 1991 | |||
Article | Outfix and Infix codes and related classes of languages | Ito, M., Jurgensen, H., Shyr, H.J., Thierring, G. | 1991 | |||
Article | A perspective on coding theory | Blake, I.F. | 1991 | |||
Article | Multidimensional trees | Baldwin, W.A., Strawn, G.O. | 1991 | |||
Article | How to generate languages using only two pairs of parentheses | Geffert, V. | 1991 | |||
Article | On the power of cooperation: a regular representation of recursively enumerable languages | Csuhaj-Varju, E., Kelemen, J. | 1991 | |||
Article | Grammar systems and colonies | Kelemen, J. | 1991 | |||
Article | Abstract grammars based on trasnductions | Asveld, P.R.J. | 1991 | |||
Article | Deciding emptiness for stack automata on infinite trees | Harel, D., Raz, D. | 1991 | |||
Article | A periodic division pattern that cannot be generated by D0L systems | de Boer, M.J.M., Lindenmayer, A. | 1991 | |||
Article | Decision problems for finite string-resriting systems that are confluent on some congruence class | Otto, F., Zhang, L. | 1991 | |||
Article | Recognizable closures and submonoids of free partially commutative monoids | Hashiguchi, K. | 1991 | |||
Article | Machine characterization of (E0L-E0L) array languages | Nirmal, N., Rama, R. | 1991 | |||
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 |