On a characterization of the nonregular set of primes

DOI10.1016/S0022-0000(68)80038-8MaRDI QIDQ2534175zbMATH OpenFDO

Authors Dennis Allen

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)80038-8

zbMATH Keywords

languages, automata, networks

Cites work

• Complexity of finite semigroups
• scientific article; zbMATH DE number 3116691 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3287733 (Why is no real title available?)
• Two memory bounds for the recognition of primes by automata
• Unrecognizable Sets of Numbers

Cited in

(4)

• Monoides syntactiques des langages algébriques
• Two memory bounds for the recognition of primes by automata
• Two memory bounds for the recognition of primes by automata
• Automaticity. IV: Sequences, sets, and diversity

This page was built for publication: On a characterization of the nonregular set of primes

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