Back to Search
Start Over
On the Descriptional Complexity of Operations on Semilinear Sets
- Source :
- EPTCS 252, 2017, pp. 41-55
- Publication Year :
- 2017
-
Abstract
- We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (i) the maximal value that appears in the vectors of periods and constants and (ii) the number of such sets of periods and constants necessary to describe the semilinear set under consideration. More precisely, we prove upper bounds on the union, intersection, complementation, and inverse homomorphism. In particular, our result on the complementation upper bound answers an open problem from [G. J. LAVADO, G. PIGHIZZINI, S. SEKI: Operational State Complexity of Parikh Equivalence, 2014].<br />Comment: In Proceedings AFL 2017, arXiv:1708.06226
- Subjects :
- Computer Science - Formal Languages and Automata Theory
F.4.3
Subjects
Details
- Database :
- arXiv
- Journal :
- EPTCS 252, 2017, pp. 41-55
- Publication Type :
- Report
- Accession number :
- edsarx.1708.06460
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.4204/EPTCS.252.8