MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES-Reference-Cited by-同舟云学术

MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

Published:2006-06 Issue:03 Volume:17 Page:493-506
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

AFONIN SERGEY¹,KHAZOVA ELENA¹

Affiliation:

1. Institute of Mechanics, Lomonosov Moscow State University, Michurinskij prospekt, 1, Moscow, 119192, Russian Federation

Abstract

Let Σ be a finite alphabet. A set [Formula: see text] of regular languages over Σ is called rational if there exists a finite set [Formula: see text] of regular languages over Σ such that [Formula: see text] is a rational subset of the finitely generated semigroup [Formula: see text] with [Formula: see text] as the set of generators and language concatenation as a product. We prove that for any rational set [Formula: see text] and any regular language R ⊆ Σ* it is decidable (1) whether [Formula: see text] or not, and (2) whether [Formula: see text] is finite or not. Possible applications to semistructured databases query processing are discussed.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054106003954

Reference16 articles.

1. Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms

2. Classification of noncounting events

3. On Decompositions of Regular Events

4. Rewriting of Regular Expressions and Regular Path Queries

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decision Problems and Applications of Rational Sets of Regular Languages;Fundamenta Informaticae;2018-08-06

2. ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES;International Journal of Foundations of Computer Science;2010-10

3. Minimal Union-Free Decompositions of Regular Languages;Language and Automata Theory and Applications;2009

4. Automaticity of semigroups of regular languages;Moscow University Mathematics Bulletin;2007-12

5. The View Selection Problem for Regular Path Queries;Lecture Notes in Computer Science