The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
There does not exist a minimal full trio with respect to bounded context-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science
Hi-index | 0.00 |
We prove in this paper that every semilinear set is a finite union of disjoint linear sets, using elementary combinatorial-topological lemmas.