The finite power problem revisited.

DOI10.1016/S0020-0190(02)00319-8MaRDI QIDQ1853154zbMATH OpenFDO

Authors Daniel Kirsten

Publication date 21 January 2003

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

Full work available at URL https://doi.org/10.1016/S0020-0190(02)00319-8

zbMATH Keywords

Finite power problemFinite power propertyFormal languagesRecognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A decision procedure for the order of regular events
• Decidability equivalence between the star problem and the finite power problem in trace monoids
• scientific article; zbMATH DE number 4218075 (Why is no real title available?)
• scientific article; zbMATH DE number 3433848 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2102758 (Why is no real title available?)
• Improved limitedness theorems on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions

Cited in

(2)

• Regular solutions of language inequalities and well quasi-orders
• Labelled well quasi ordered classes of bounded linear clique-width

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853154)