The equivalence problem for deterministic two-way sequential transducers is decidable

Authors:
Eitan M. Gurari
Affiliations:
-
Venue:
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Year:
1980

Citing 0
Cited 1

Quality-aware service delegation in automated web service composition: an automata-theoretic approach

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.