Post-plus languages

DOI10.1016/S0304-3975(99)00157-7zbMath0974.68100WikidataQ127720379 ScholiaQ127720379MaRDI QIDQ5941064

No author found.

Publication date: 20 August 2001

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

zbMATH Keywords

non-counting languagespost-plus languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A note of involutively bordered words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• \(d\)-minimal languages
• Monogenic \(e\)-closed languages and dipolar words
• Right \(k\)-dense languages
• Shuffle Relations and Codes
• K-catenation and applications:k-prefix codes

This page was built for publication: Post-plus languages