PETRI AUTOMATA

Brunet, P; Pous, D

Brunet, P (reprint author), Univ Lyon, CNRS, ENS Lyon, UCB Lyon 1,LIP, Lyon, France.

LOGICAL METHODS IN COMPUTER SCIENCE, 2017; 13 (3):

Abstract

Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise t......

Full Text Link