Eilenberg's variety theorem without Boolean operations

DOI10.1016/j.ic.2022.104916OpenAlexW4225266528WikidataQ113872835 ScholiaQ113872835MaRDI QIDQ6186309

Fabian Birkmann, Henning Urbat, Stefan Milius

Publication date: 2 February 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104916

zbMATH Keywords

quantum finite automatapseudovarietyEilenberg's theoremvariety of regular languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Birkhoff theorem for finite algebras
• Quantum automata and quantum grammars
• Groupoidal completely distributive lattices
• On language varieties without Boolean operations
• Equational axiomatization of algebras with structure
• Syntactic structures of regular languages
• Profinite Monads, Profinite Equations, and Reiterman’s Theorem
• Recognisable Languages over Monads
• Duality and Equational Theory of Regular Languages
• Free Completely Distributive Lattices
• Generalized Eilenberg Theorem
• On finite monoids having only trivial subgroups
• Probabilistic automata

This page was built for publication: Eilenberg's variety theorem without Boolean operations