![]() |
![]() |
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.
Source : ScholeXplorer
IsReferencedBy ARXIV 1104.2803 Source : ScholeXplorer IsReferencedBy DOI 10.1145/2422085.2422092 Source : ScholeXplorer IsReferencedBy DOI 10.48550/arxiv.1104.2803 Source : ScholeXplorer IsReferencedBy HANDLE 1822/35523 Source : ScholeXplorer IsReferencedBy HANDLE 1887/59681 Source : ScholeXplorer IsReferencedBy HANDLE 2066/111253
Bonsangue, M.M. ; Milius, S. ; Silva, A. ; |