Combinatorial and Computational Problems on Finite Sets of Words

Authors:
Juhani Karhumäki
Affiliations:
-
Venue:
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Year:
2001

Citing 12
Cited 0

A proof of Ehrenfeucht's conjecture

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

Theoretical Computer Science
Text algorithms

Text algorithms
Combinatorics of words

Handbook of formal languages, vol. 1
The expressibility of languages and relations by word equations

Journal of the ACM (JACM)
The commutation of finite sets: a challenging problem

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
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
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
Satisfiability of Word Equations with Constants is in PSPACE

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Decision Questions Concerning Semilinearity Morphisms and

Decision Questions Concerning Semilinearity Morphisms and

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is to give a survey on recent work studying several combinatorial and computational problems on finite sets of words. The problems are natural extensions of three well-understood problems on words, namely those of the commutation, the conjugacy, and the equivalence of morphisms on regular languages. Each of these problems provides challenging questions in the case of finite sets of words.