Geometrical regular languages and linear Diophantine equations: the strongly connected case
DOI10.1016/J.TCS.2012.04.012zbMATH Open1279.68141OpenAlexW2003854010MaRDI QIDQ443737FDOQ443737
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
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
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- On Powers of Non-Negative Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Context-Free Languages
- Title not available (Why is that?)
- On a Problem of Partitions
- Finite automata and unary languages
- Certified dense linear system solving
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
- Regular geometrical languages and tiling the plane
- Linear Automaton Transformations
- Geometricity of binary regular languages
- Title not available (Why is that?)
- Enumeration of the Elementary Circuits of a Directed Graph
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)
