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
Online AccessGet full text

Cover

Loading…