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)
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
68Q70: Algebraic theory of languages and automata
03B25: Decidability of theories and sets of sentences
20M35: Semigroups in automata theory, linguistics, etc.
68Q19: Descriptive complexity and finite models
Related Items
Quantifiers on languages and codensity monads, Kleene Theorems for Product Systems, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, The complexity of intersecting finite automata having few final states, Fragments of first-order logic over infinite words, On the lattice of sub-pseudovarieties of DA., A topological approach to non-uniform complexity, Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages, On FO 2 Quantifier Alternation over Words, Regular Languages Definable by Majority Quantifiers with Two Variables