MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
type: Item
instance of: scholarly article
title: MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
zbMATH Open document ID: 1103.68062
DOI: 10.1142/S0129054106003954
author: Sergey Afonin
author: Elena Khazova
published in: International Journal of Foundations of Computer Science
publication date: 2006-08-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5045307
zbMATH Keywords: rational set of languages
zbMATH Keywords: finiteness conditions
zbMATH Keywords: finite power property
MaRDI profile type: MaRDI publication profile
cites work: Q5570933
cites work: Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
cites work: Classification of noncounting events
cites work: On Decompositions of Regular Events
cites work: Rewriting of regular expressions and regular path queries
cites work: A finiteness condition for finitely generated semigroups
cites work: Limitedness theorem on finite automata with distance functions
cites work: Representation theorems on regular languages
cites work: On language equations with invertible operations
cites work: A Burnside approach to the finite substitution problem
cites work: The limitedness problem on distance automata: Hashiguchi's method revisited
cites work: Q3948608
cites work: On semigroups of matrices over the tropical semiring
full work available at URL: s0129054106003954
OpenAlex ID: W2059493817
description: scientific article; zbMATH DE number 5045307