The Branching Point Approach to Conway's Problem

Authors:
Juhani Karhumäki;Ion Petre
Affiliations:
-;-
Venue:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Year:
2002

Citing 6
Cited 2

Combinatorics of words

Handbook of formal languages, vol. 1
The commutation of finite sets: a challenging problem

Theoretical Computer Science
Theory of Codes

Theory of Codes
Conway's problem for three-word sets

Theoretical Computer Science
Challenges of Commutation

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the Decomposition of Finite Languages

On the Decomposition of Finite Languages

The Commutation with Codes and Ternary Sets of Words

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Conjugacy of finite biprefix codes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A word u is a branching point for a set of words X if there are two different letters a and b such that both ua and ub can be extended to words in X+. A branching point u is critical for X if u 驴 X+. Using these notions, we give an elementary solution for Conway's Problem in the case of finite biprefixes. We also discuss a possible extension of this approach towards a complete solution for Conway's Problem.