The finite power problem revisited.

DOI10.1016/S0020-0190(02)00319-8zbMath1042.68609MaRDI QIDQ1853154

Daniel Kirsten

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Formal languagesRecognizable languagesFinite power problemFinite power property

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Regular solutions of language inequalities and well quasi-orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved limitedness theorems on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions
• A decision procedure for the order of regular events
• Decidability equivalence between the star problem and the finite power problem in trace monoids

This page was built for publication: The finite power problem revisited.