Logic Meets Algebra: the Case of Regular Languages
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Descriptive complexity and finite models (68Q19) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)
Recommendations
Cited in
(18)- On algebraic and logical specifications of classes of regular languages.
- A topological approach to non-uniform complexity
- scientific article; zbMATH DE number 1670817 (Why is no real title available?)
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- scientific article; zbMATH DE number 2086254 (Why is no real title available?)
- scientific article; zbMATH DE number 988809 (Why is no real title available?)
- On FO 2 Quantifier Alternation over Words
- The complexity of intersecting finite automata having few final states
- Regular Languages Definable by Majority Quantifiers with Two Variables
- scientific article; zbMATH DE number 7362722 (Why is no real title available?)
- Quantifiers on languages and codensity monads
- Kleene theorems for product systems
- Fragments of first-order logic over infinite words
- Developments in Language Theory
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
- Substitution Principle and semidirect products
- Unary and two-variable interval logics
- On the lattice of sub-pseudovarieties of DA.
This page was built for publication: Logic Meets Algebra: the Case of Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310680)
