Geometrical Regular Languages and Linear Diophantine Equations
From MaRDI portal
Publication:5200085
DOI10.1007/978-3-642-22600-7_9zbMath1341.68083MaRDI QIDQ5200085
Jean-Philippe Dubernard, Hadrien Jeanne, Franck Guingne, Jean-Marc Champarnaud
Publication date: 29 July 2011
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_9
05C90: Applications of graph theory
68Q45: Formal languages and automata
05C40: Connectivity
11D04: Linear Diophantine equations
Cites Work
- 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
- Depth-First Search and Linear Graph Algorithms
- On a Problem of Partitions