Filter Results
2 results
- Data for: Syntactic complexity of bifix-free regular languagesAn implementation of the algorithm from the proof of Theorem 13.
- Dataset
- Test polynomials for approximate GCD algorithmsDataset of test data (Tables 1–3) used in the paper: Akira Terui, GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theoretical Computer Science, Volume 479 (Symbolic-Numerical Algorithms), April 2013, 127-149. doi:10.1016/j.tcs.2012.10.023 arXiv:1207.0630
- Dataset