scientific article

zbMath0578.68062MaRDI QIDQ3700856

Clelia De Felice, Antonio Restivo

Publication date: 1985

Full work available at URL: https://eudml.org/doc/92241

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

free monoidcomplete code

Mathematics Subject Classification ID

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

Related Items (14)

A note on codes having no finite completions ⋮ Construction of a family of finite maximal codes ⋮ Hajós factorizations and completion of codes. ⋮ On codes having no finite completion ⋮ Languages whose \(n\)-element subsets are codes ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing codes ⋮ Codes and maximal monoids ⋮ Pseudo-cyclic renewal systems ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ On a complete set of operations for factorizing codes ⋮ On codes having no finite completion ⋮ On maximal codes with a finite interpreting delay. ⋮ Locally complete sets and finite decomposable codes

Cites Work

• Unnamed Item
• Unnamed Item
• A counterexample to the triangle conjecture
• A conjecture on sets of differences of integer pairs
• A note on the triangle conjecture
• Baionnettes et cardinaux
• On the triangle conjecture
• On codes having no finite completions

This page was built for publication: