Logic characterization of invisibly structured languages: the case of Floyd languages

DOI10.1007/978-3-642-35843-2_27MaRDI QIDQ2927655zbMATH OpenOpenAlexFDO

Authors Violetta Lonati, Dino Mandrioli, Matteo Pradella

Publication date 4 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11311/709735

zbMATH Keywords

deterministic context-free languagesmonadic second-order logicoperator precedence languagespushdown automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Precedence automata and languages
• Operator precedence and the visibly pushdown property
• Operator precedence and the visibly pushdown property
• Operator precedence languages: their automata-theoretic and logic characterization
• Higher-order operator precedence languages

Cited in

(4)

• Operator precedence and the visibly pushdown property
• Operator precedence languages: their automata-theoretic and logic characterization
• Precedence automata and languages
• First-order logic definability of free languages

This page was built for publication: Logic characterization of invisibly structured languages: the case of Floyd languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927655)