Logic Characterization of Floyd Languages

Details Logic Characterization of Floyd Languages Logic Characterization of Floyd Languages

2012-04-20

arxiv.org/abs/1204.4639v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

Floyd languages (FL), alias Operator Precedence Languages, have recently received renewed attention thanks to their closure properties and local parsability which allow one to apply automatic verification techniques (e.g. model checking) and parallel and incremental parsing. They properly include various other classes, noticeably Visual Pushdown languages. In this paper we provide a characterization of FL in terms a monadic second order logic (MSO), in the same style as Buchi's one for regular languages. We prove the equivalence between automata recognizing FL and the MSO formalization.

Affiliated with

Also associated with

No associations

Rating

Logic Characterization of Floyd 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 Logic Characterization of Floyd Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic Characterization of Floyd Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5837