Weight-reducing Hennie machines and their descriptional complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8370 LNCS, Issue , 2014, Pages 553-564

  Průša, Daniel ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

descriptional complexity; Finite automata; Hennie machine; two way automata

Indexed keywords

DESCRIPTIONAL COMPLEXITY; FINITE-STATE; NONDETERMINISTIC FINITE AUTOMATON; TWO-WAY AUTOMATA; TWO-WAY FINITE AUTOMATA;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FINITE AUTOMATA;

EID: 84898078907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-04921-2_45     Document Type: Conference Paper

References (15)

1. Birget, J.C.: State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory 26(3), 237-269 (1993)
2. Durak, B.: Two-way finite automata with a write-once track. J. Autom. Lang. Comb. 12(1), 97-115 (2007)
3. Globerman, N., Harel, D.: Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science 169, 161-184 (1996)
4. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8(2), 193-234 (2002)
5. Hartmanis, J.: Computational complexity of one-tape Turing machine computations. J. ACM 15(2), 325-339 (1968)
6. Hennie, F.: One-tape, off-line Turing machine computations. Information and Control 8(6), 553-578 (1965)
7. Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396-406. Springer, Heidelberg (2001)
8. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS), pp. 188-191. IEEE Computer Society (1971)
9. Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)
10. Průša, D., Mráz, F.: Two-dimensional sgraffito automata. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 251-262. Springer, Heidelberg (2012)
11. Radó, T.: On non-computable functions. Bell System Technical Journal 41(3), 877-884 (1962)
12. Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1-17 (2008)
13. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, New York, NY, USA, pp. 275-286 (1978)
14. Shannon, C.E.: A universal Turing machine with two internal states. Annals of Mathematics Studies 34, 157-165 (1956)
15. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3(2), 198-200 (1959)