A Remark on Acceptable Sets of Numbers

DOI10.1145/321450.321461MaRDI QIDQ5549813zbMATH OpenOpenAlexFDO

Authors Marcel Paul Schützenberger

Publication date 1968

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321450.321461

zbMATH Keywords

languages, automata, networks

Cited in

(7)

• Space complexity in on-line computation
• Multiplicative automatic sequences
• Two memory bounds for the recognition of primes by automata
• Two memory bounds for the recognition of primes by automata
• Properties and limits of recognition of sets of integers by countable automata
• On the complexity of a family of \(k\)-context-free sequences
• On a problem of Gelfond: the sum of digits of prime numbers

This page was built for publication: A Remark on Acceptable Sets of Numbers

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