Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson

DOI10.1016/0304-3975(85)90214-2zbMath0574.20053OpenAlexW1987163048MaRDI QIDQ1063697

Do Long Van

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90214-2

zbMATH Keywords

infinite wordssubmonoidscode-compatibilityinfinitary codeSardinas-Patterson theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Bi-infinitary codes ⋮ On a class of infinitary codes

Cites Work

• Sous-monoides et codes avec des mots infinis
• The intersection of free submonoids of a free monoid is free
• The Sardinas/Patterson and Levenshtein theorems
• Unnamed Item
• Unnamed Item

This page was built for publication: Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson