References

  1. S. Beier, M. Holzer & M. Kutrib (2017): Operational State Complexity and Decidability of Jumping Finite Automata. In: Proceedings DLT, LNCS 10396. Springer, pp. 96–108, doi:10.1007/978-3-319-62809-7_6.
  2. D. Chistikov & Ch. Haase (2016): The Taming of the Semi-Linear Set. In: Proceedings ICALP, LIPIcs 55. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 128:1–128:13, doi:10.4230/LIPIcs.ICALP.2016.128.
  3. L. E. Dickson (1913): Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American J. Math. 35(4), pp. 413–422, doi:10.2307/2370405.
  4. J. von zur Gathen & M. Sieveking (1978): A bound on solutions of linear integer equalities and inequalities. Proc. Am. Math. Soc. 72, pp. 155–158, doi:10.1090/S0002-9939-1978-0500555-0.
  5. S. Ginsburg & E. H. Spanier (1964): Bounded ALGOL-like languages. Trans. AMS 113, pp. 333–368, doi:10.2307/1994067.
  6. S. Ginsburg & E. H. Spanier (1966): Finite-Turn Pushdown Automata. SIAM J. Comput. 4, pp. 429–453, doi:10.1137/0304034.
  7. T.-D. Huynh (1980): The complexity of semilinear sets. In: Proceedings ICALP, LNCS 85. Springer, pp. 324–337, doi:10.1007/3-540-10003-2_81.
  8. G. J. Lavado, G. Pighizzini & S. Seki (2013): Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inform. Comput. 228–229, pp. 1–15, doi:10.1016/j.ic.2013.06.003.
  9. G. J. Lavado, G. Pighizzini & S. Seki (2014): Operational State Complexity under Parikh Equivalence. In: Proceedings DCFS, LNCS 8614. Springer, pp. 294–305, doi:10.1007/978-3-319-09704-6_26.
  10. A. Meduna & P. Zemek (2012): Jumping Finite Automata. Internat. J. Found. Comput. Sci. 23, pp. 1555–1578, doi:10.1142/S0129054112500244.
  11. R. J. Parikh (1966): On Context-Free Languages. J. ACM 13, pp. 570–581, doi:10.1145/321356.321364.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org