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_8zbMATH Open1172.68497OpenAlexW1550295382MaRDI QIDQ3602802FDOQ3602802

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

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

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Title not available (Why is that?)
• On Context-Free Languages
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
• Linear Automaton Transformations
• Title not available (Why is that?)
• Discrete Geometry for Computer Imagery

   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 👍 👎

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)