Removing bidirectionality from nondeterministic finite automata

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 544-555

  Kapoutsis, Christos ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE;

NONDETERMINISTIC FINITE AUTOMATON;

AUTOMATA THEORY;

EID: 26844550536     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_47     Document Type: Conference Paper

References (19)

1. Rabin, M.O., Scott, D.: Remarks on finite automata. In: Proceedings of the Summer Institute of Symbolic Logic, Cornell (1957) 106-112
2. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3 (1959) 114-125
3. Ott, G.: On multipath automata I. Research report 69, SRRC (1964)
4. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of the Symposium on Switching and Automata Theory. (1971) 188-191
5. Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transactions on Computers 20 (1971) 1211-1214
6. Seiferas, J.I.: Manuscript communicated to M. Sipser (October 1973)
7. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the Symposium on the Theory of Computing. (1978) 275-286
8. Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM Journal of Computing 27 (1998) 1073-1082
9. Rabin, M.O.: Two-way finite automata. In: Proceedings of the Summer Institute of Symbolic Logic, Cornell (1957) 366-369
10. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal of Research and Development 3 (1959) 198-200
11. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA (1979)
12. Birget, J.C.: State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory 26 (1993) 237-269
13. Damanik, D.: Finite automata with restricted two-way motion. Master's thesis, J. W. Goethe-Universität Frankfurt (1996) (In German.)
14. Birget, J.C.: Two-way automata and length-preserving homomorphisms. Report 109, Department of Computer Science, University of Nebraska (1990)
15. Barnes, B.H.: A two-way automaton with fewer states than any equivalent one-way automaton. IEEE Transactions on Computers C-20 (1971) 474-475
16. Sipser, M.: Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences 21 (1980) 195-202
17. Kapoutsis, C.: Deterministic moles cannot solve liveness. (In preparation.)
18. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. Journal of Universal Computer Science 8 (2002) 193-234
19. Vardi, M.Y.: A note on the reduction of two-way automata to one-way automata. Information Processing Letters 30 (1989) 261-264