Geometricity of Binary Regular Languages
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS(2010)
摘要
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.
更多查看译文
关键词
off-line temporal validation,original model,efficient geometricity test,prolongable binary regular language,interesting theoretical property,minimal automaton,geometrical language.,efficient algorithm,geometrical language,regular case,regular language,real time,algorithm design
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要