A note on one-way and two-way automata

DOI10.1007/BF01705881MaRDI QIDQ5582343zbMATH OpenFDO

Authors J. Hartmanis

Publication date 1970

Published in Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

languages, automata, networks

Recommendations

• A note on two-way probabilistic automata
• From two-way to one-way finite automata -- three regular expression-based methods
• Two-way non-uniform finite automata
• Two-way finite automata: old and recent results
• Remarks on two-way automata with weak-counters

Cites work

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines

Cited in

(3)

• From two-way to one-way finite automata -- three regular expression-based methods
• Two-way finite automata with a write-once track
• Endmarkers can make a difference

This page was built for publication: A note on one-way and two-way automata

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