Kleene theorems for free choice automata over distributed alphabets
From MaRDI portal
Publication:2032915
DOI10.1007/978-3-662-60651-3_6zbMath1464.68258arXiv1907.01168OpenAlexW2990551305MaRDI QIDQ2032915
Publication date: 14 June 2021
Full work available at URL: https://arxiv.org/abs/1907.01168
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)