A Census of Finite Automata
From MaRDI portal
Publication:5537386
DOI10.4153/CJM-1965-010-9zbMath0156.01703OpenAlexW2332168526MaRDI 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 (13)
Random Deterministic Automata ⋮ The Number of Isomorphism Types of Finite Algebras ⋮ Enumerating transformation semigroups ⋮ Principle of inclusion-exclusion on partially ordered sets ⋮ IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES ⋮ Enumeration and generation with a string automata representation ⋮ Random generation of DFAs ⋮ Sets with involutions: power group enumeration ⋮ Arithmetical properties of finite graphs and polynomials ⋮ Enumeration and random generation of accessible automata ⋮ Semicomputable points in Euclidean spaces ⋮ Enumerating regular expressions and their languages ⋮ Principle of inclusion-exclusion on semilattices
This page was built for publication: A Census of Finite Automata
