First-order logic definability of free languages
From MaRDI portal
Recommendations
Cites work
- Adding nesting structure to words
- Algebraic properties of operator precedence languages
- First-Order and Temporal Logics for Nested Words
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 2079028 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Logic characterization of invisibly structured languages: the case of Floyd languages
- Noncounting Context-Free Languages
- Operator precedence \(\omega \)-languages
- Operator precedence and the visibly pushdown property
- Parenthesis Grammars
- Precedence automata and languages
- Some properties of precedence languages
- The minimalization of tree automata
- The use of grammatical inference for designing programming languages
Cited in
(10)- Generalizing input-driven languages: theoretical and practical benefits
- Operator precedence languages: their automata-theoretic and logic characterization
- Non-definability of Languages by Generalized First-order Formulas over (N,+)
- scientific article; zbMATH DE number 1261672 (Why is no real title available?)
- First-order functional languages and intensional logic
- scientific article; zbMATH DE number 1775532 (Why is no real title available?)
- AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES
- On Existentially First-Order Definable Languages and Their Relation to NP
- scientific article; zbMATH DE number 5238362 (Why is no real title available?)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
This page was built for publication: First-order logic definability of free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194725)