MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

DOI10.1142/S0129054106003954zbMATH Open1103.68062OpenAlexW2059493817MaRDI QIDQ5483370FDOQ5483370

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

Recommendations

• Developments in Language Theory
• Decision Problems and Applications of Rational Sets of Regular Languages
• The rational subset membership problem for groups: a survey
• On the rational subset problem for groups.
• On the structure and complexity of rational sets of regular languages

zbMATH Keywords

finiteness conditionsfinite power propertyrational set of languages

Mathematics Subject Classification ID

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

Cites Work

• On Decompositions of Regular Events
• On semigroups of matrices over the tropical semiring
• Limitedness theorem on finite automata with distance functions
• The limitedness problem on distance automata: Hashiguchi's method revisited
• On language equations with invertible operations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Representation theorems on regular languages
• Rewriting of regular expressions and regular path queries
• Classification of noncounting events
• A finiteness condition for finitely generated semigroups
• 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

Cited In (9)

• Fundamentals of Computation Theory
• Principles and Practice of Constraint Programming – CP 2004
• The View Selection Problem for Regular Path Queries
• Decision Problems and Applications of Rational Sets of Regular Languages
• Title not available (Why is that?)
• Closure properties and complexity of rational sets of regular languages
• Membership problems for regular and context-free trace languages
• On the structure of finitely generated semigroups of unary regular languages
• Minimal Union-Free Decompositions of Regular Languages

This page was built for publication: MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

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