Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | Random Context Languages | van der Walt, A. | 1971 | |||
Article | Magic Numbers in the State Hierarchy of Finite Automata | Geffert, V. | 2006 | |||
Article | Accepting Grammars and Systems | Bordihn, H., Fernau, H. | 1995 | |||
Article | On Pebble Automata | Chang, J.H., Ibarra, O.H., Palis, M.A. | 1986 | |||
Article | How to make arbitrary grammars look like context-free grammars | Savitch, W.J. | 1973 | |||
Article | On Some Special Classes of Regular Languages | Imreh, B., Ito, M. | ||||
Article | On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages | Okawa, S., Hirose, S., Yoneda, M. | 1986 | |||
Article | A recognition algorithm for pushdown store systems | Aho, A.V., Hopcroft, J.E., Ullman, J.D. | ||||
Article | A New-Old Class of Linguistically Motivated Regulated Grammars | Marcus, S., Martín-Vide, C., Mitrana, V., Paun, Gh. | ||||
Article | Two-Way Pushdown Automata | Gray, J.N., Harrison, M.A., Ibarra, O.H. | 1967 | |||
Article | One-Way Stack Automata | Ginsburg, S., Greibach, S.A., Harrison, M.A. | 1967 | |||
Article | Ambiguity in Context Free Languages | Ginsburg, S., Ullian, J. | 1964 | |||
Article | Stack Automata and Compiling | Ginsburg, S., Greibach, S.A., Harrison, M.A. | 1967 | |||
Article | n-Parallel n-Right Linear Simple Matrix Languages | Wood, D. | 1975 | |||
Article | A note on the generative capacity of random context | Atcheson, B., Ewert, S., Shell, D. | 2006 | |||
Article | A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages | Dömösi, P., Okawa, S. | 2001 | |||
Article | Homomorphic characterizations of poly-slender context-free languages | Dömösi, P., Hirose, S., Okawa, S. | 2002 | |||
Article | A New Form Of Homomorphic Characterization of Context-free Languages | Dömösi, P., Okawa, S. | 2003 | |||
Article | Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages | Hirose, S., Okawa, S. | 1996 | |||
Article | Dyck Reductions are More Powerful Than Homomorphic Characterizations | Hirose, S., Kimura, H., Okawa, S. | 1997 | |||
Article | Homomorphic characterizations of recursively enumerable languages with very small language classes | Hirose, S., Okawa, S. | 2001 | |||
Article | Context-Free Languages in Biological Systems | Herman, G.T., Walker, A. | 1975 | |||
Article | A Calculus of Circular Proofs and its Categorical Semantics | Santocanale, L. | 2001 | |||
Article | Open Problems in the Emergence and Evolution of Linguistic Communication: A Road-Map for Research | Nehaniv, C.L. | ||||
Article | Finite Automata | Ésik, Z., Kuich, W. | ||||
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 |