Document Open Access Logo

Star Complexity of Parikh Images of Languages over Infinite Alphabets

Author Yoav Danieli

PDF

File

Thumbnail PDF
PDF
LIPIcs.LICS.2026.35.pdf
  • Filesize: 0.97 MB
  • 26 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Grammars and context-free languages
  • Theory of computation → Automata over infinite objects
Keywords
  • infinite alphabets
  • Parikh image
  • rational sets
  • star-height

Metrics

Abstract

It has been conjectured that the Parikh (commutative) image of every language over an infinite alphabet recognized by an automaton with registers is defined by a rational expression. This conjecture is known to hold for all languages recognized by one-register automata. We refine this result by proving that the star-height of the Parikh image of any language recognized by a one-register automaton is universally bounded by two. Furthermore, we show that one-register context-free languages have rational commutative images of arbitrarily high star height. We then disprove the conjecture for multiple registers, as well as disprove the equivalence of commutative expressive power between context-free grammars and automata over infinite alphabets. In other words, we show that Parikh’s theorem fails for infinite alphabets.

Cite As Get BibTex

Yoav Danieli. Star Complexity of Parikh Images of Languages over Infinite Alphabets. In 41st Annual Symposium on Logic in Computer Science (LICS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 380, pp. 35:1-35:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.LICS.2026.35

Author Details

Yoav Danieli
  • Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel

References

  1. Mikołaj Bojanczyk. Slightly infinite sets, 2019. A draft of a book available at URL: https://www.mimuw.edu.pl/~bojan/paper/atom-book.
  2. Mikolaj Bojanczyk, Bartek Klin, and Slawomir Lasota. Automata with group actions. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, pages 355-364. IEEE, IEEE Computer Society, 2011. URL: https://doi.org/10.1109/LICS.2011.48.
  3. Mikolaj Bojanczyk, Bartek Klin, and Slawomir Lasota. Automata theory in nominal sets. Log. Methods Comput. Sci., 10(3):1-44, 2014. URL: https://doi.org/10.2168/LMCS-10(3:4)2014.
  4. Taolue Chen, Fu Song, and Zhilin Wu. Formal reasoning on infinite data values: An ongoing quest. In Jonathan P. Bowen, Zhiming Liu, and Zili Zhang, editors, Engineering Trustworthy Software Systems - Second International School, SETSS 2016, Chongqing, China, March 28 - April 2, 2016, Tutorial Lectures, volume 10215 of Lecture Notes in Computer Science, pages 195-257, 2016. URL: https://doi.org/10.1007/978-3-319-56841-6_6.
  5. Edward Y. C. Cheng and Michael Kaminski. Context-free languages over infinite alphabets. Acta Informatica, 35(3):245-267, 1998. URL: https://doi.org/10.1007/s002360050120.
  6. Lorenzo Clemente, Slawomir Lasota, and Radoslaw Piórkowski. Determinisability of register and timed automata. Log. Methods Comput. Sci., 18(2):Paper No. 9, 37, 2022. URL: https://doi.org/10.46298/lmcs-18(2:9)2022.
  7. Yoav Danieli. Star complexity of parikh images of languages over infinite alphabets, 2026. URL: https://arxiv.org/abs/2605.09435.
  8. Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3):16:1-16:30, 2009. URL: https://doi.org/10.1145/1507244.1507246.
  9. Samuel Eilenberg. Automata, languages, and machines. A. Pure and applied mathematics. Academic Press, 1974. URL: https://www.worldcat.org/oclc/310535248.
  10. Samuel Eilenberg and Marcel Paul Schützenberger. Rational sets in commutative monoids. J. Algebra, 13(2):173-191, 1969. Google Scholar
  11. Diego Figueira and Anthony Widjaja Lin. Reasoning on data words over numeric domains. In Christel Baier and Dana Fisman, editors, LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pages 37:1-37:13. ACM, 2022. URL: https://doi.org/10.1145/3531130.3533354.
  12. Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, and Henning Urbat. Alternating nominal automata with name allocation. In 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pages 57-70. IEEE, 2025. URL: https://doi.org/10.1109/LICS65433.2025.00012.
  13. Daniel Genkin, Michael Kaminski, and Liat Peterfreund. A note on the emptiness problem for alternating finite-memory automata. Theor. Comput. Sci., 526:97-107, 2014. URL: https://doi.org/10.1016/j.tcs.2014.01.020.
  14. Matthew Hague, Artur Jez, and Anthony W. Lin. Parikh’s theorem made symbolic. Proc. ACM Program. Lang., 8(POPL):1945-1977, 2024. URL: https://doi.org/10.1145/3632907.
  15. Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, and Mohnish Pattathurajan. Parikh’s theorem for infinite alphabets. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pages 1-13. IEEE, 2021. URL: https://doi.org/10.1109/LICS52264.2021.9470626.
  16. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329-363, 1994. URL: https://doi.org/10.1016/0304-3975(94)90242-9.
  17. Michael Kaminski and Daniel Zeitlin. Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci., 21(5):741-760, 2010. URL: https://doi.org/10.1142/S0129054110007532.
  18. Ahmet Kara. Logics on data words: Expressivity, satisfiability, model checking. PhD thesis, Technical University of Dortmund, Germany, 2016. URL: https://hdl.handle.net/2003/35216.
  19. Bartek Klin, Slawomir Lasota, and Szymon Torunczyk. Nondeterministic and co-nondeterministic implies deterministic, for data languages. In Stefan Kiefer and Christine Tasson, editors, Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, volume 12650 of Lecture Notes in Computer Science, pages 365-384. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-71995-1_19.
  20. Slawomir Lasota and Mohnish Pattathurajan. Parikh images of register automata. In Mikolaj Bojanczyk and Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, Virtual Conference, December 15-17, 2021, volume 213 of LIPIcs, pages 50:1-50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.50.
  21. Harry R. Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, 1981. URL: https://www.worldcat.org/oclc/299372519.
  22. Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos. Bisimilarity in fresh-register automata. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 156-167. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/LICS.2015.24.
  23. Frank Neven, Thomas Schwentick, and Victor Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log., 5(3):403-435, 2004. URL: https://doi.org/10.1145/1013560.1013562.
  24. Rohit Parikh. On context-free languages. J. ACM, 13(4):570-581, 1966. URL: https://doi.org/10.1145/321356.321364.
  25. Michael O. Rabin and Dana S. Scott. Finite automata and their decision problems. IBM J. Res. Dev., 3(2):114-125, 1959. URL: https://doi.org/10.1147/rd.32.0114.
  26. Luc Segoufin. Automata and logics for words and trees over an infinite alphabet. In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, volume 4207 of Lecture Notes in Computer Science, pages 41-57. Springer, 2006. URL: https://doi.org/10.1007/11874683_3.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact