Sweeping permutation automata

DOI10.1007/S00236-025-00519-6MaRDI QIDQ6855669zbMATH OpenFDO

Authors Maria Radionova, Alexander Okhotin

Publication date 20 February 2026

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00236-025-00519-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
• Formal languages over GF(2)
• scientific article; zbMATH DE number 3972214 (Why is no real title available?)
• scientific article; zbMATH DE number 4020506 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• Inference of Reversible Languages
• Lower bounds on the size of sweeping automata
• Mathematical Foundations of Computer Science 2005
• On the accepting state complexity of operations on permutation automata
• On the state complexity of operations on two-way finite automata
• Operations on Permutation Automata
• Permutation automata
• Proceedings of the 38th annual IEEE symposium on foundations of computer science, FOCS 1997, Miami Beach, FL, USA, October 20--22, 1997
• Reversibility of computations in graph-walking automata
• State complexity of operations on two-way finite automata over a unary alphabet
• Sweeping permutation automata

This page was built for publication: Sweeping permutation automata

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