Non-deterministic two-tape automata are more powerful than deterministic ones

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

Volumn 182 LNCS, Issue , 1985, Pages 71-79

  Brauer, W ^a   Lange, K J ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE GRAMMARS;

FINITE STATE; RATIONAL SUBSETS;

CONTEXT FREE LANGUAGES;

EID: 0038007166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0023996     Document Type: Conference Paper

References (15)

1. [BE] Berstel, Jean: Transductions and Context-Free Languages, Teubner-Verlag, Stuttgart 1979.
2. [BO] Book, Ronald, V.: Remarks on linear context-free languages, EATCS Bulletin 10 (1980) 30-31.
3. [BRG] Brandenburg, Franz-Josef: On FIFO and LIFO type languages, in Acted de L'Ecole de Printemps de Theorie des Languages, ed.: M. Blab, Muriol (1981), 193-201.
4. [BR1] Brauer, Wilfried: W-automata and their languages, Proc MFCS '76, LNCS vol. 45 (1976) 12-22.
5. [BR2] Brauer, wilfried: Automatentheorie, Teubner-Verlag, Stuttgart, 1984.
6. [DI] Dikowskii, Y.A.: A note on deterministic linear languages, Systems Theory Research, Transl. of Problemy Kibernetiki 23 (1972) 295-300.
7. [EES] Eilenberg, S., Elgot, C.C., Shepherdson, J.C.: Sets recognized by n-tape automata, J. Algebra 13 (1969) 447-464.
8. [EM] Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata, IBM J. Develop. 9 (1965) 47-68.
9. [GI] Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.
10. [HA] Harrison, M.A.: Introduction to Formal Language Theory, Addison-Wesley, 1978.
11. [NI] Nivat, M.: Transductions des langages de Chomsky, Thése d'Etat, Univ. de Paris, 1967, und in: Ann. de l'Inst. Fourier, Grenoble 18 (1968) 339-456.
12. [RS] Rabin, M.O., Scott, D.: Finite automata and their decision problems, IBM J. Research and Development 3, (1959), 114-125.
13. [RO] Rosenberg, A.: A machine realization of the linear context-free languages, Inf. & Control 10 (1967) 175-188.
14. [SH] Shamir, E.: Some inherently ambiguous context-free languages, Information and Control 18, (1971), 355-363.
15. [WA] Walljasper, S.J.: Non-Deterministic Automata and Effective Languages, Ph.D. Thesis, Univ. of Iowa, AD-69 2421, (1969).