On the multiplying ability of two-way automata

DOI10.1016/S0022-0000(68)80036-4zbMath0197.00701OpenAlexW2062471066MaRDI QIDQ2539647

J. R. H. Dempster

Publication date: 1968

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(68)80036-4

zbMATH Keywords

recursion theory, constructive mathematics

Cites Work

• A universal two-way automaton

This page was built for publication: On the multiplying ability of two-way automata