Computer Science – Logic in Computer Science
Scientific paper
2008-03-12
Theoretical Computer Science 322 (1) (2004) 69-84
Computer Science
Logic in Computer Science
Scientific paper
Locally finite omega languages were introduced by Ressayre in [Journal of Symbolic Logic, Volume 53, No. 4, p.1009-1026]. They generalize omega languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOC_omega of locally finite omega languages. In particular we show that the class LOC_omega is neither closed under intersection nor under complementation, giving an answer to a question of Ressayre.
No associations
LandOfFree
Closure Properties of Locally Finite Omega Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Closure Properties of Locally Finite Omega Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Closure Properties of Locally Finite Omega Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-69241