A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c

Authors:
Juhani Karhumäki;Leonid P. Lisovik
Affiliations:
-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 7
Cited 2

On the equivalence of some transductions involving letter to letter morphisms on regular languages

Acta Informatica
The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Theoretical Computer Science
Combinatorics of words

Handbook of formal languages, vol. 1
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On the Equivalence of Finite Substitutions and Transducers

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the Centralizer of a Finite Set

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Commutation of Finite Sets: a Challenging Problem

The Commutation of Finite Sets: a Challenging Problem

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

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Combinatorial and Computational Problems on Finite Sets of Words

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.00

Visualization

Abstract

As an evidence of the power of finite unary substitutions we show that the inclusion problem for finite substitutions on the language L = ab*c is undecidable, i.e. it is undecidable whether for two finite substitutions ϕ and Ψ the relation ϕ(w) ⊆ (w) holds for all w in L.