On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels

DOI10.1007/BF02733427zbMath0953.68564MaRDI QIDQ1974312

I. G. Potapov, A. N. Kurganskij

Publication date: 18 July 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the progress of communication between two finite state machines
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels