Languages and P0L schemes

DOI10.1080/00207160500112936zbMath1101.68659OpenAlexW2117910465MaRDI QIDQ5699917

No author found.

Publication date: 27 October 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160500112936

zbMATH Keywords

codepalindromeprimitiveP0L schemeproperty preserving substitution

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Prefix-primitivity-preserving homomorphisms ⋮ Borderedness-preserving homomorphisms

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Properties of Fibonacci languages
• Some properties of disjunctive languages on a free monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages and P0L schemes