Establishing certain bounds concerning finite automata

DOI10.1016/S0022-0000(73)80010-8zbMath0283.68047MaRDI QIDQ1844548

Joseph Winograd, Zvi Kohavi

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Synchronizing Automata and the Černý Conjecture ⋮ In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton ⋮ Černý's conjecture and the road colouring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stress Effects on Thin-Film Parametrons
• Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines
• On Information Lossless Automata of Finite Order
• On the Lower Bound to the Memory of Finite State Machines
• On Finite-Memory Sequential Machines

This page was built for publication: Establishing certain bounds concerning finite automata