\(d\)-minimal languages

DOI10.1016/S0166-218X(98)00105-XzbMath0928.68067OpenAlexW2052823579MaRDI QIDQ1281400

K. Appert

Publication date: 20 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00105-x

zbMATH Keywords

proper d-factor of a word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (10)

Codes defined by multiple sets of trajectories ⋮ Onn-power prefix languages ⋮ WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID ⋮ Disjunctivity and other properties of sets of pseudo-bordered words ⋮ Post-plus languages ⋮ Borderedness-preserving homomorphisms ⋮ INVOLUTIVELY BORDERED WORDS ⋮ Watson-Crick palindromes in DNA computing ⋮ Watson-Crick Conjugate and Commutative Words ⋮ Some combinatorial properties of solid codes

Cites Work

• Solid codes and disjunctive domains
• Monogenic \(e\)-closed languages and dipolar words
• Properties of annihilators of languages
• Ordered catenation and regular free disjunctive languages
• Some properties of disjunctive languages on a free monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(d\)-minimal languages