PlayGround

test

TypeTitleAuthorPublisherYear
Article On multiple grammars Kral, J. 1969
Article Complexity Theory and the Operational Structure of Algebraic Programming Systems Asveld, P.R.J., Tucker, J.V. 1982
Article On the regularity of wquality languages Karhumaki, J. 1984
Article On the Sequence Equivalence Problem for 0L Systems with Controlled Derivations Dassow, J. 1988
Article Test sets for context free langauges and algebraic systems of equations over a free monoid Albert, J., Culik II, K., Karhumaki, J. 1982
Article Algorithmes D'Analyse Syntaxique Pour Langages „Context-Free“ II Brasseur, M., Cohen, J. 1965
Article On some relations defined by languages Novotny, M.
Article Algorithmes D'Analyse Syntaxique Pour Langages „Context-Free“ I Brasseur, M., Cohen, J. 1965
Article A normal form for context-sensitive grammars Penttonen, M. 1972
Article Symmetric Graphs and Interpretations Welzl, E. 1983
Article Context-free parsing on O(n) processors Barnard, D.T., Skillicorn, D.B. 1991
Article High Level Tree Transducers and Iterated Pushdown Tree Transducers Engelfriet, J., Vogler, H. 1988
Article Integration requirements for tool-based generation of information system documentation Verrijn-Stuart, A.A. 1993
Article Conceptual data base description using graph-grammars Schneider, H.J. 1976
Article Category theory and models for parallel computation Winskel, G.
Article Context-Free Like Restrictions on Selective Rewriting Kleijn, H.C., Rozenberg, G. 1981
Article Non-uniform automata over groups Barrington, D.A.M., Straubing, H., Therien, D. 1990
Article Derivation Languages of Grammar Forms Maurer, H.A., Salomaa, A., Wood, D. 1981
Article Complexity classes of g-systems are AFL Rovan, B. 1986
Article Denseness, Maximality, and Decidability of Grammatical Families Maurer, H.A., Salomaa, A., Welzl, E., Wood, D. 1984
Article On totalistic systolic networks Culik II, K., Karhumaki, J. 1988
Article Tolerances and Congruences on Implication Algebras Chajda, I., Zelinka, B. 1986
Article On ground-confluences of term rewriting systems Kapur, D., Narendran, P., Otto, F. 1990
Article Cur-rule axiomatization of product-free Lambek calculus with the empty string Zielonka, W. 1988
Article A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free Kral, 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

playground/playground.txt · Last modified: 2022/09/27 01:04 by xhavel44
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki