PlayGround

test

TypeTitleAuthorPublisherYear
Article Rostocker mathemathisches kolloquium 59 2005
Article Roughly Sorting: A Generalization of Sorting Igarashi, Y., Wood, D. 1987
Article Rule trees represent derivations in edge replacement systems Kreowski, H.-J. 1986
Article Sample answers to some exercises in elementary computability, formal languages, and automata McNaughton, R. 1994
Article Scattered Context Grammars Greibach, S., Hopcroft, J. 1969
Article Scattered context grammars that erase nonterminals in a generalized k-limited way Meduna, A., Techet, J. 2008
Article Scattered context grammars with regulation Fernau, H. 1996
Article Scattered versus context-sensitive rewriting Gonczarowski, J., Warmuth, M.K. 1989
Article Scattered versus context-sensitive rewriting Gonczarowski, J., Warmuth, M.K. 1989
Article Searching with Uncerainty Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E. 1987
Article Selective substitution array grammars Siromoney, R., Subramanian, K.G. 1981
Article Selective substitution grammars (towards a framework for rewriting systems). Part 1. Definitions and examples Rozenberg, G. 1977
Article Selective substitution grammars based on context-free productions Kleijn, J. 1983
Article Semi-top-down syntactic analysis Kral, J., Demner, J. 1973
Article Semirings and formal power series Droste, M., Kuich, W.
Article Semirings, automata, languages Kuich, W., Salomaa, A. 1986
Article Sequential machines realized by group representations Conner, M. 1990
Article Set-theoretic concepts in programming languages and their implementation Schneider, H.J. 1980
Article Simple Deterministic Langauges Korenjak, A.J., Hopcroft, J.E. 1966
Article Simple E0L forms under uniform interpretation generating CF languages Albert, J., Maurer, H.A., Rozenberg, G. 1979
Article Simple Matrix Languages Ibarra, O.H. 1970
Article Simple chain gramamrs and languages Nijholt, A. 1979
Article Simulation of systolic tree automata on trellis automata Fachini, E., Gruska, J., Schettini, A.M., Sangiorgi, D. 1990
Article Six nonterminals are enough for generating each R.E. language by a matrix grammar Paun, Gh. 1984
Article Six nonterminals are enough for generating each r.e. Langauges by a matrix grammar Paun, Gh. 1984
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