Indistinguishability of finite automata with constrained behavior

DOI10.1007/BF02367769zbMath0889.68109OpenAlexW2011064026MaRDI QIDQ1375267

A. N. Kurganskij, I. S. Grunskii

Publication date: 5 February 1998

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

Full work available at URL: https://doi.org/10.1007/bf02367769

zbMATH Keywords

automata interacting

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the progress of communication between two finite state machines
• On behaviour of automata in labyrinths

This page was built for publication: Indistinguishability of finite automata with constrained behavior