A Census of Finite Automata
From MaRDI portal
Publication:5537386
DOI10.4153/CJM-1965-010-9zbMath0156.01703MaRDI QIDQ5537386
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
Related Items
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, 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