Geometrical regular languages and linear Diophantine equations: the strongly connected case

DOI10.1016/J.TCS.2012.04.012MaRDI QIDQ443737zbMATH OpenOpenAlexFDO

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

Publication date 13 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.04.012

zbMATH Keywords

regular languageDiophantine equationgeometrical languageminimal deterministic automatonParikh image

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Geometrical regular languages and linear Diophantine equations
• Geometricity of binary regular languages
• Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
• Decidability of geometricity of regular languages
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL

Cites work

• scientific article; zbMATH DE number 3913686 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 3300651 (Why is no real title available?)
• Certified dense linear system solving
• Enumeration of the Elementary Circuits of a Directed Graph
• Finite automata and unary languages
• Geometricity of binary regular languages
• Linear Automaton Transformations
• On Context-Free Languages
• On Powers of Non-Negative Matrices
• On a Problem of Partitions
• Regular geometrical languages and tiling the plane
• WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Cited in

(5)

• Geometrical regular languages and linear Diophantine equations
• Geometricity of binary regular languages
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• An extensive review of the literature using the Diophantine equations to study fuzzy set theory
• Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)

This page was built for publication: Geometrical regular languages and linear Diophantine equations: the strongly connected case

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