First-Order Logic Definability of Free Languages

DOI10.1007/978-3-319-20297-6_20zbMath1465.68122OpenAlexW1200108254MaRDI QIDQ3194725

Matteo Pradella, Violetta Lonati, Dino Mandrioli, Federica Panella

Publication date: 20 October 2015

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

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

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 (3)

Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Generalizing input-driven languages: theoretical and practical benefits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Operator precedence and the visibly pushdown property
• Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages
• Precedence Automata and Languages
• Adding nesting structure to words
• First-Order and Temporal Logics for Nested Words
• Algebraic properties of operator precedence languages
• Noncounting Context-Free Languages
• Operator Precedence ω-Languages
• Some properties of precedence languages
• Parenthesis Grammars
• The minimalization of tree automata
• The use of grammatical inference for designing programming languages

This page was built for publication: First-Order Logic Definability of Free Languages