A Census of Finite Automata

DOI10.4153/CJM-1965-010-9MaRDI QIDQ5537386zbMATH OpenOpenAlexFDO

Authors Michael A. Harrison

Publication date 1965

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1965-010-9

zbMATH Keywords

mathematical logic

Cited in

(13)

• Principle of inclusion-exclusion on partially ordered sets
• Arithmetical properties of finite graphs and polynomials
• Enumerating transformation semigroups
• Random generation of DFAs
• Principle of inclusion-exclusion on semilattices
• Enumerating regular expressions and their languages
• Enumeration and generation with a string automata representation
• Random deterministic automata
• Semicomputable points in Euclidean spaces
• The Number of Isomorphism Types of Finite Algebras
• IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
• Sets with involutions: power group enumeration
• Enumeration and random generation of accessible automata

This page was built for publication: A Census of Finite Automata

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