Two memory bounds for the recognition of primes by automata

DOI10.1007/BF01746518zbMATH Open0179.02403MaRDI QIDQ5569461FDOQ5569461

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

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

Cited In (4)

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

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)