Establishing certain bounds concerning finite automata

DOI10.1016/S0022-0000(73)80010-8zbMATH Open0283.68047MaRDI QIDQ1844548FDOQ1844548

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Information Lossless Automata of Finite Order
• Stress Effects on Thin-Film Parametrons
• Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines
• On the Lower Bound to the Memory of Finite State Machines
• On Finite-Memory Sequential Machines

Cited In (3)

• 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
• Synchronizing Automata and the Černý Conjecture

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

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