Affiliation:
1. Massachusetts Institute of Technology, Cambridge, Massachusetts
Abstract
Hopcroft and Ullman (problem 3.10 [1]) pose the amusing question of whether the "first third" of a regular language L, FIRST-THIRD(L) = {x| x is a prefix of a member of L of length 3|x|}, is necessarily regular. To see that it is, we can adapt of 1-way deterministic finite-state acceptor (an FA, for short) for L to get a 2-way non-deterministic finite-state acceptor with endmarkers for FIRST-THIRD(L). This acceptor behaves like the FA on x until it reaches the right endmarker, and then it uses another pass over x at half speed to behave like the FA on some nondeterministically chosen continuation of length 2|x|. That such an acceptor accepts a regular language follows from an argument similar to that of Shepherdson for deterministic acceptors [2].
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Reference3 articles.
1. Formal Languages and Their Relation to Automata, Addison-Wesley, Reading;Hopcroft J. E.;Mass.,1969
2. The Reduction of Two-Way Automata to One-Way Automata
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Operations preserving regular languages;Theoretical Computer Science;2006-04
2. Operations Preserving Recognizable Languages;Fundamentals of Computation Theory;2003
3. Regularity-preserving relations;Theoretical Computer Science;1976
4. Context-free preserving functions;Mathematical Systems Theory;1975-06
5. Regularity preserving functions;ACM SIGACT News;1974-04