Detectability of labeled weighted automata over monoids
From MaRDI portal
Publication:6343698
DOI10.1007/S10626-022-00362-8zbMath1524.68180arXiv2006.14164MaRDI QIDQ6343698
Publication date: 25 June 2020
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Observability (93B07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication: Detectability of labeled weighted automata over monoids