Logic Meets Algebra: the Case of Regular Languages
From MaRDI portal
Publication:5310680
DOI10.2168/LMCS-3(1:4)2007zbMath1128.03029MaRDI QIDQ5310680
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Descriptive complexity and finite models (68Q19)
Related Items (11)
On FO 2 Quantifier Alternation over Words ⋮ The complexity of intersecting finite automata having few final states ⋮ Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words ⋮ Substitution Principle and semidirect products ⋮ Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages ⋮ Fragments of first-order logic over infinite words ⋮ On the lattice of sub-pseudovarieties of DA. ⋮ A topological approach to non-uniform complexity ⋮ Kleene Theorems for Product Systems ⋮ Regular Languages Definable by Majority Quantifiers with Two Variables ⋮ Quantifiers on languages and codensity monads
This page was built for publication: Logic Meets Algebra: the Case of Regular Languages