Ultrafilters on words for a fragment of logic

DOI10.1016/j.tcs.2015.08.007zbMath1332.68149OpenAlexW2151103848MaRDI QIDQ896678

Andreas Krebs, Mai Gehrke, Jean-Eric Pin

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.007

zbMATH Keywords

formal languagesregular languagesultrafiltersprofinite equationsstone duality

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Stone spaces (Boolean spaces) and related structures (06E15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Pro-aperiodic monoids via saturated models ⋮ A topological approach to non-uniform complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-uniform automata over groups
• Duality and Equational Theory of Regular Languages
• A Topological Approach to Recognition
• EQUATIONAL DESCRIPTIONS OF LANGUAGES
• Profinite Methods in Automata Theory
• Extensional Uniformity for Boolean Circuits
• From Ultrafilters on Words to the Expressive Power of a Fragment of Logic
• CONSTANT-DEPTH PERIODIC CIRCUITS