Two memory bounds for the recognition of primes by automata

DOI10.1007/BF01746518zbMath0179.02403MaRDI QIDQ5569461

Herbert S. Shank, Juris Hartmanis

Publication date: 1969

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

zbMATH Keywords

languages, automata, networks

Related Items (4)

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

Cites Work

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

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