Non-Deterministic Kleene Coalgebras
Non-Deterministic Kleene Coalgebras
复制标题
DOI：
10.2168/lmcs-6(3:23)2010
复制
发表时间：
2010-07
期刊：
影响因子：
--
通讯作者：
Alexandra Silva;M. Bonsangue;J. Rutten
中科院分区：
文献类型：
--
作者：
Alexandra Silva;M. Bonsangue;J. Rutten
在本文中，我们提出了一个系统的方法来推导（1）（广义）正则表达式的语言，（2）健全和完整的公理化，为各种各样的系统。这推广了Kleene（关于正则语言和确定性有限自动机）和米尔纳（关于正则行为和有限标号转移系统）的结果，并包括许多其他系统，如Mealy和摩尔机。
In this paper, we present a systematic way of deriving (1) languages of (gener- alised) 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 de- terministic finite automata) and Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.