Weak Mso with the Unbounding Quantifier

Details Weak Mso with the Unbounding Quantifier Weak Mso with the Unbounding Quantifier

2009-02-06

arxiv.org/abs/0902.1042v1

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 159-170

Computer Science

Formal Languages and Automata Theory

Scientific paper

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier). Effective translations between the logic and automata are given.

Affiliated with

Also associated with

No associations

Rating

Weak Mso with the Unbounding Quantifier 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 Weak Mso with the Unbounding Quantifier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak Mso with the Unbounding Quantifier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251549