The Equivalence Problem of Finite Substitutions on ab*c, with Applications

Authors:
Juhani Karhumäki;Leonid P. Lisovik
Affiliations:
-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 13
Cited 2

A proof of Ehrenfeucht's conjecture

Theoretical Computer Science
The equivalence of finite valued transducers (on HDT0L languages) is decidable

Theoretical Computer Science
The equivalence problem of multitape finite automata

Theoretical Computer Science
Decomposing finite-valued transducers and deciding their equivalence

SIAM Journal on Computing
Equations over finite sets of words and equivalence problems in automata theory

Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Theoretical Computer Science
Morphisms

Handbook of formal languages, vol. 1
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
On the Equivalence of Finite Substitutions and Transducers

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Challenges of Commutation

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Some Open Problems in Combinatorics of Words and Related Areas

Some Open Problems in Combinatorics of Words and Related Areas
The equivalence problem for deterministic two-tape automata

Journal of Computer and System Sciences

A simple undecidable problem: the inclusion problem for finite substitutions on ab*c

Information and Computation
Commutation with codes

Theoretical Computer Science - The art of theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that it is undecidable whether or not two finite substitutions are equivalent on the fixed regular language ab*c. This gives an unexpected answer to a question proposed in 1985 by Culik II and Karhum盲ki. At the same time it can be seen as the final result in a series of undecidability results for finite transducers initiated in 1968 by Griffiths. An application to systems of equations over finite languages is given.