Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages

DOI10.1007/978-3-642-35843-2_27zbMath1303.68080OpenAlexW2156349171MaRDI QIDQ2927655

Matteo Pradella, Dino Mandrioli, Violetta Lonati

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

monadic second-order logicpushdown automatadeterministic context-free languagesoperator precedence languages

Mathematics Subject Classification ID

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

Related Items (2)

First-Order Logic Definability of Free Languages ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization

This page was built for publication: Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages