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_8zbMath1172.68497OpenAlexW1550295382MaRDI QIDQ3602802

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)

Cites Work

• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
• Linear Automaton Transformations
• Discrete Geometry for Computer Imagery
• On Context-Free Languages
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Unnamed Item
• Unnamed Item

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)