Varieties Generated by Certain Models of Reversible Finite Automata

DOI10.1007/11809678_11zbMATH Open1162.68480OpenAlexW2157832134MaRDI QIDQ3591302FDOQ3591302

Authors: Marats Golovkins, Jean-Éric Pin 

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

Recommendations

• scientific article; zbMATH DE number 6292604
• Reversible nondeterministic finite automata
• scientific article; zbMATH DE number 4020506
• Quantum finite automata and probabilistic reversible automata: \(\mathcal{R}\)-trivial idempotent languages
• Two-way reversible multi-head finite automata

Mathematics Subject Classification ID

Quantum computation (81P68) Algebraic theory of languages and automata (68Q70) Applications of universal algebra in computer science (08A70)

Cited In (3)

• On language varieties without Boolean operations
• Title not available (Why is that?)
• Lower Bounds for Generalized Quantum Finite Automata

This page was built for publication: Varieties Generated by Certain Models of Reversible Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591302)