On a characterization of the nonregular set of primes

DOI10.1016/S0022-0000(68)80038-8zbMath0177.01903MaRDI QIDQ2534175

Dennis Allen

Publication date: 1968

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

zbMATH Keywords

languages, automata, networks

Related Items (4)

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 ⋮ Monoides syntactiques des langages algébriques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of finite semigroups
• Unrecognizable Sets of Numbers
• Two memory bounds for the recognition of primes by automata

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