A Basis Theorem for a Class of Two‐Way Automata

DOI10.1002/MALQ.19660120120zbMATH Open0207.30503OpenAlexW2007016493MaRDI QIDQ5607993FDOQ5607993

Authors: Donald L. Kreider, R. W. Ritchie 

Publication date: 1966

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19660120120

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Cited In (3)

• The equivalence of pebbles and sensing heads for finite automata
• On the pre-AFL of \([lg\;n]\) space and related families of languages
• Marker automata

This page was built for publication: A Basis Theorem for a Class of Two‐Way Automata

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