Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | A pumping lemma for random permitting context languages | Ewert, S., van der Walt, A. | 2002 | |||
Article | A shrinking lemma for random forbidding context languages | Ewert, S., van der Walt, A. | 2000 | |||
Article | Regulated Finite Index Language Families Collapse | Fernau, H., Holzer, M. | 1996 | |||
Article | On Some Special Classes of Regular Languages | Imreh, B., Ito, M. | ||||
Article | Scattered Context Grammars | Greibach, S., Hopcroft, J. | 1969 | |||
Article | Finite Turns and the Regular Closure of Linear Context-Free Languages | Kutrib, M., Malcher, A. | 2006 | |||
Article | Minimal Union-Free Decompositions of Regular Languages | Afonin, S., Golomazov, D. | ||||
Article | On States Observability in Deterministic Finite Automata | Mateescu, A., Paun, Gh. | 1987 | |||
Article | Turing Machines with Sublogarithmic Space | Szepietowski, A. | 1994 | |||
Article | Random Grammars | Malyshev, V. | 1997 | |||
Article | How to make arbitrary grammars look like context-free grammars | Savitch, W.J. | 1973 | |||
Article | On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages | Okawa, S., Hirose, S., Yoneda, M. | 1986 | |||
Article | Pushdown Automata with Counters | Kameda, T. | 1972 | |||
Article | A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages | Dömösi, P., Okawa, S. | 2001 | |||
Article | Context-Free Languages in Biological Systems | Herman, G.T., Walker, A. | 1975 | |||
Article | Homomorphic characterizations of recursively enumerable languages with very small language classes | Hirose, S., Okawa, S. | 2001 | |||
Article | Dyck Reductions are More Powerful Than Homomorphic Characterizations | Hirose, S., Kimura, H., Okawa, S. | 1997 | |||
Article | Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages | Hirose, S., Okawa, S. | 1996 | |||
Article | A New Form Of Homomorphic Characterization of Context-free Languages | Dömösi, P., Okawa, S. | 2003 | |||
Article | Homomorphic characterizations of poly-slender context-free languages | Dömösi, P., Hirose, S., Okawa, S. | 2002 | |||
Article | A note on the generative capacity of random context | Atcheson, B., Ewert, S., Shell, D. | 2006 | |||
Article | A recognition algorithm for pushdown store systems | Aho, A.V., Hopcroft, J.E., Ullman, J.D. | ||||
Article | n-Parallel n-Right Linear Simple Matrix Languages | Wood, D. | 1975 | |||
Article | Stack Automata and Compiling | Ginsburg, S., Greibach, S.A., Harrison, M.A. | 1967 | |||
Article | Ambiguity in Context Free Languages | Ginsburg, S., Ullian, J. | 1964 | |||
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 |