Characterizing the Regular Languages by Nonforgetting Restarting Automata
From MaRDI portal
Publication:5199973
DOI10.1007/978-3-642-22321-1_25zbMath1221.68133OpenAlexW166697159MaRDI QIDQ5199973
Norbert Hundeshagen, Friedrich Otto
Publication date: 29 July 2011
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_25
Related Items (4)
On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Restarting transducers, regular languages, and rational relations ⋮ On Restarting Automata with Window Size One ⋮ On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
This page was built for publication: Characterizing the Regular Languages by Nonforgetting Restarting Automata
