Two memory bounds for the recognition of primes by automata

DOI10.1007/BF01746518MaRDI QIDQ5569461zbMATH OpenFDO

Authors Herbert S. Shank, J. Hartmanis

Publication date 1969

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

zbMATH Keywords

languages, automata, networks

Cites work

• A Remark on Acceptable Sets of Numbers
• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
• On a characterization of the nonregular set of primes
• On the Recognition of Primes by Automata
• Unrecognizable Sets of Numbers

Cited in

(4)

• Marker automata
• Space complexity in on-line computation
• On a characterization of the nonregular set of primes
• On tape bounds for single letter alphabet language processing

This page was built for publication: Two memory bounds for the recognition of primes by automata

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