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

Authors:
J. Karhumäki;L. P. Lisovik
Affiliations:
Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Cybernetics, Kiev National University, Kiev 252017, Ukraine
Venue:
Information and Computation
Year:
2003

Citing 8
Cited 1

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
The commutation of finite sets: a challenging problem

Theoretical Computer Science
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Conway's problem for three-word sets

Theoretical Computer Science
On the Equivalence of Finite Substitutions and Transducers

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
The Equivalence Problem of Finite Substitutions on ab*c, with Applications

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Finite sets of words and computing

MCU'04 Proceedings of the 4th 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.