Conway's problem for three-word sets.

DOI10.1016/S0304-3975(01)00389-9zbMath1061.68097OpenAlexW2049485421WikidataQ60162919 ScholiaQ60162919MaRDI QIDQ1853553

Ion Petre, Juhani Karhumäki

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00389-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) ⋮ Playing with Conway's problem ⋮ On structure of domains with quadratic growth. ⋮ A first step in characterizing three-element codes ⋮ The second step in characterizing a three-word code ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Commutation with codes ⋮ Decision problems for language equations ⋮ On the complexity of decidable cases of the commutation problem of languages ⋮ On the simplest centralizer of a language ⋮ Regular solutions of language inequalities and well quasi-orders ⋮ Unresolved systems of language equations: expressive power and decision problems

Cites Work

• Codes et motifs
• Centralizers in Free Associative Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conway's problem for three-word sets.