On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility
From MaRDI portal
Publication:1239135
DOI10.1016/S0022-0000(77)80038-XzbMath0357.94053MaRDI QIDQ1239135
Publication date: 1977
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68Q45: Formal languages and automata
Cites Work