Varieties Generated by Certain Models of Reversible Finite Automata
From MaRDI portal
Publication:3591302
DOI10.1007/11809678_11zbMath1162.68480OpenAlexW2157832134MaRDI QIDQ3591302
Jean-Eric Pin, Marats Golovkins
Publication date: 10 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11809678_11
Quantum computation (81P68) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70)
Related Items (2)
Lower Bounds for Generalized Quantum Finite Automata ⋮ On language varieties without Boolean operations
This page was built for publication: Varieties Generated by Certain Models of Reversible Finite Automata