Geometricity of Binary Regular Languages

Our aim is to present an efficient algorithm for checking whether a regular language is geometrical or not, based on specific properties of its minimal automaton. Geometrical languages have interesting theoretical properties and they provide an original model for off-line temporal validation of real...

Full description

Saved in:
Bibliographic Details
Published inLanguage and Automata Theory and Applications pp. 178 - 189
Main Authors Champarnaud, Jean-Marc, Dubernard, Jean-Philippe, Jeanne, Hadrien
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
geometrical language
minimal automaton
regular language
Online AccessGet full text

Cover

More Information
Summary:Our aim is to present an efficient algorithm for checking whether a regular language is geometrical or not, based on specific properties of its minimal automaton. Geometrical languages have interesting theoretical properties and they provide an original model for off-line temporal validation of real-time softwares. As far as implementation is concerned, the regular case is of practical interest, which motivates the design of an efficient geometricity test addressing the family of regular languages. This study generalizes the algorithm designed by the authors for the case of prolongable binary regular languages.
ISBN:9783642130885
3642130887
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-13089-2_15