On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone

DOI10.1007/11753728_26zbMath1185.68394OpenAlexW1772960798MaRDI QIDQ3434699

Friedrich Otto, Hartmut Messerschmidt

Publication date: 2 May 2007

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753728_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Left-to-right regular languages and two-way restarting automata ⋮ A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ Languages Accepted by Weighted Restarting Automata* ⋮ On Restarting Automata with Window Size One ⋮ Weighted Restarting Automata as Language Acceptors

This page was built for publication: On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone