Correction to: ``Computational limitations of affine automata and generalized affine automata

DOI10.1007/S11047-021-09848-0zbMATH Open1530.68149OpenAlexW3146742534MaRDI QIDQ6095492FDOQ6095492

Mika Hirvensalo, Abuzer Yakaryılmaz, Etienne Moutot

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-021-09848-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Corrigendum to our paper: How Expressions Can Code for Automata
• Corrigendum to: ``Iterated stack automata and complexity classes
• Corrections to “A Menagerie of Timed Automata”
• Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages

This page was built for publication: Correction to: ``Computational limitations of affine automata and generalized affine automata

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