Seymour Ginsburg
ABSTRACT
A study is made of conditions on a language L which ensure that the smallest intersection-closed full AFL containing L (written @@@@ @@@@(L)) does or does not contain all recursively enumerable languages. For example, it is shown that if L = {ani/i @@@@ 0}and [equation]inf ni+1/ni>1, then [equation](L) contains all recursively enumerable languages. On the other hand, it is shown that if L @@@@ a* and the ratio of the number of words in L of length less than n to n goes to 1 as [equation], then [equation] does not contain all recursively enumerable languages.
- 1.S. Ginsburg and S. Greibach, "Abstract Families of Languages", in Studies in Abstract Families of Languages, Memoirs of the American Mathematical Society, No. 87, 1969, pp. 1-32.Google Scholar
- 2.J. Goldstine, "Abstract Families of Languages Generated by Bounded Languages", System Development Corporation Report TM-738/059/00, 4 June 1970.Google Scholar
- 3.S. Greibach and S. Ginsburg, "Multitape AFA", System Development Corporation Report TM-738/050/00, 2 January 1969.Google Scholar
- 4.J. Hartmanis and J. Hopcroft, "What Makes Some Language Theory Problems Undecidable", Journal of Computer and System Sciences, Vol. 4 (1970), pp. 368-376.Google ScholarDigital Library
- 5.M. Minsky, "Recursive Unsolvability of Post's Problem of 'Tag' and other Topics in the Theory of Turing Machines", Annals of Mathematics, Vol. 74 (1961), pp. 437-455.Google ScholarCross Ref
- 6.M. Rabin and D. Scott, "Finite Automata and their Decision Problems", IBM Journal of Research and Development, Vol. 3 (1959), pp. 114-125.Google ScholarDigital Library
Index Terms
- Intersection-closed full AFL and the recursively enumerable languages
Recommendations
Polynomial generators of recursively enumerable languages
DLT'05: Proceedings of the 9th international conference on Developments in Language TheoryFor each language L, let $\hat{\mathcal F}_\cap(L)$ be the smallest intersection-closed full AFL generated by the language L. Furthermore, for each natural number k≥ 2 let $P_k=\{a^{n^k}|n\in\mathbb N\}$. By applying certain classical and recent results ...
On simple generators of recursively enumerable languages
For each language L, let F ( L ) ( C ( L ) , resp.) be the intersection-closed full AFL (full trio, resp.) generated by L. Furthermore, for each natural number k 2 let P k = { a n k | n N } . By applying certain classical and recent results on ...
Partial learning of recursively enumerable languages
This paper studies several typical learning criteria in the model of partial learning of r.e. sets in the recursion-theoretic framework of inductive inference. Its main contribution is a complete picture of how the criteria of confidence, consistency ...
Comments