Decidability of the multiplicity equivalence of multitape finite automata

Authors:
T. Harju;J. Karhumäki
Affiliations:
Dept. of Mathematics, University of Turku, SF-20500 Turku, Finland;Dept. of Mathematics, University of Turku, SF-20500 Turku, Finland
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Citing 6
Cited 3

On recent trends in formal language theory

14th International Colloquium on Automata, languages and programming
Rational series and their languages

Rational series and their languages
HDTOL matching of computations of multitape automata

Acta Informatica
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series

A test for λ-confluence for certain prefix rewriting systems with applications to the generalized word problem

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata

Theoretical Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract