AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL

DOI10.1142/S0129054109006863zbMath1191.68376MaRDI QIDQ3395146

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

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite automataregular languagesgeometrical languageminimal automatontemporal validationgeometricity test

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Enumeration of specific classes of polycubes ⋮ Regular Geometrical Languages and Tiling the Plane

Cites Work

• Unnamed Item
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
• Linear Automaton Transformations
• On Context-Free Languages

This page was built for publication: AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL