2012/04/20 by Violetta Lonati, Lonati, Violetta, Dino Mandrioli +3
Computer Science · #68Q45 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #cs.FL #cs.LO #msc:68Q45 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1204.4639
arxiv created 2012/04/20 · openalex publication_date 2012/04/20 · arxiv updated 2012/04/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.