On language varieties without Boolean operations

DOI10.1007/978-3-030-68195-1_1OpenAlexW3134604594MaRDI QIDQ2232259

Stefan Milius, Fabian Birkmann, Henning Urbat

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2011.06951

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Eilenberg's variety theorem without Boolean operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Superiority of exact quantum automata for promise problems
• The Birkhoff theorem for finite algebras
• Equational axiomatization of algebras with structure
• Syntactic structures of regular languages
• Profinite Monads, Profinite Equations, and Reiterman’s Theorem
• Characterizations of 1-Way Quantum Finite Automata
• Recognisable Languages over Monads
• Duality and Equational Theory of Regular Languages
• Varieties Generated by Certain Models of Reversible Finite Automata
• Free Completely Distributive Lattices
• Generalized Eilenberg Theorem
• Eilenberg Theorems for Free
• STACS 2004
• On finite monoids having only trivial subgroups

This page was built for publication: On language varieties without Boolean operations