DocumentCode
2175528
Title
The equivalence problem for deterministic two-way sequential transducers is decidable
Author
Gurari, Eitan M.
fYear
1980
fDate
13-15 Oct. 1980
Firstpage
83
Lastpage
85
Abstract
The equivalence problem for deterministic twoway sequential transducers is a long time open problem which is known to be decidable for some restricted cases. Here, the problem is shown to be decidable also for the general case. This even when the devices are allowed to make some finite number of nondeterministic moves.
Keywords
Automata; Computational modeling; Computer science; Concurrent computing; Counting circuits; Magnetic heads; Transducers; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1980., 21st Annual Symposium on
Conference_Location
Syracuse, NY, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1980.46
Filename
4567808
Link To Document