Geometrical regular languages and linear Diophantine equations: the strongly connected case
From MaRDI portal
Publication:443737
DOI10.1016/j.tcs.2012.04.012zbMath1279.68141MaRDI QIDQ443737
Jean-Philippe Dubernard, Hadrien Jeanne, Jean-Marc Champarnaud, Franck Guingne
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
regular language; Diophantine equation; geometrical language; minimal deterministic automaton; Parikh image
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite automata and unary languages
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
- Certified dense linear system solving
- Regular Geometrical Languages and Tiling the Plane
- Linear Automaton Transformations
- On Powers of Non-Negative Matrices
- Geometricity of Binary Regular Languages
- Enumeration of the Elementary Circuits of a Directed Graph
- On Context-Free Languages
- On a Problem of Partitions