Efficiency of automata in semi-commutation verification techniques
Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani [ (2001) 399–408] proved that the class of regular languages – called APC – of the form U ..., where the union is finite and each is either a single symbol or a language of the form with a subset of the alphabet, is closed under all semi-commutation relations . Moreover...