Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)

DOI10.1007/978-3-540-70844-5_8MaRDI QIDQ3602802zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Dubernard, Hadrien Jeanne, Jean-Marc Champarnaud

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_8

zbMATH Keywords

finite automataregular languagesgeometrical languageminimal automatontemporal validationgeometricity test

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• Geometricity of binary regular languages
• Decidability of geometricity of regular languages
• Geometrical regular languages and linear Diophantine equations: the strongly connected case
• Geometrical regular languages and linear Diophantine equations

Cites work

• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• Discrete Geometry for Computer Imagery
• Linear Automaton Transformations
• On Context-Free Languages
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Cited in

(6)

• Geometrical regular languages and linear Diophantine equations
• Decidability of geometricity of regular languages
• Geometricity of binary regular languages
• Geometrical regular languages and linear Diophantine equations: the strongly connected case
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• Geometrical closure of binary \(V_{3/2}\) languages

This page was built for publication: Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602802)