Enumeration of strongly connected sequential machines

DOI10.1016/S0019-9958(65)90316-5zbMath0127.01102MaRDI QIDQ5332225

C. E. Radke

Publication date: 1965

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

mathematical logic

Related Items (3)

IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES ⋮ Enumeration and random generation of accessible automata ⋮ Enumerating regular expressions and their languages

This page was built for publication: Enumeration of strongly connected sequential machines