MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

DOI10.1142/S0129054106003954zbMath1103.68062OpenAlexW2059493817MaRDI QIDQ5483370

Elena Khazova, Sergey Afonin

Publication date: 14 August 2006

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

Full work available at URL: https://doi.org/10.1142/s0129054106003954

zbMATH Keywords

finiteness conditionsfinite power propertyrational set of languages

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45)

Related Items

ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES, Minimal Union-Free Decompositions of Regular Languages, The View Selection Problem for Regular Path Queries

Cites Work

• Unnamed Item
• Unnamed Item
• Rewriting of regular expressions and regular path queries
• Limitedness theorem on finite automata with distance functions
• Representation theorems on regular languages
• On language equations with invertible operations
• The limitedness problem on distance automata: Hashiguchi's method revisited
• A Burnside approach to the finite substitution problem
• Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
• Classification of noncounting events
• On semigroups of matrices over the tropical semiring
• On Decompositions of Regular Events
• A finiteness condition for finitely generated semigroups