Finite sets of words and computing

Authors:
Juhani Karhumäki
Affiliations:
Department of Mathematics and, Turku Centre for Computer Science, University of Turku, Turku, Finland
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 16
Cited 3

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

Theoretical Computer Science
Formal languages

Formal languages
Combinatorics of words

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

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
Theory of Codes

Theory of Codes
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
On the Composition of Morphisms and Inverse Morphisms

Proceedings of the 10th Colloquium on Automata, Languages and Programming
The Commutation with Codes and Ternary Sets of Words

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c

Information and Computation
Satisfiability of word equations with constants is in PSPACE

Journal of the ACM (JACM)
Computation: finite and infinite machines

Computation: finite and infinite machines
Commutation with codes

Theoretical Computer Science - The art of theory
The power of commuting with finite sets of words

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Computing by commuting

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the existence of prime decompositions

Theoretical Computer Science
Prime decompositions of regular languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss about two recent undecidability results in formal language theory. The corresponding problems are very simply formulated questions on finite sets of words. In particular, these results underline how finite sets of words can be used to perform powerful computations.