The single loop representations of regular languages
Discrete Applied Mathematics
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
Hi-index | 5.26 |
We consider the class USk of uniformly k-sparse simple graphs, i.e., the class of finite or countable simple graphs, every finite subgraph of which has a number of edges bounded by k times the number of vertices. We prove ...