Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata (2307.03561v1)

Published 7 Jul 2023 in cs.FL

Abstract: We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while they fall into different classes for what concerns non-emptiness. The problem of non-emptiness is known to be Ackermann-complete for HRA, we prove that it is PSPACE-complete for $\nu$-A.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (17)
  1. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2006. URL: https://theory.cs.princeton.edu/complexity/book.pdf.
  2. Clement Bertrand. Reconnaissance de motifs dynamiques par automates temporisés à mémoire. Theses, Université Paris-Saclay, December 2020. URL: https://theses.hal.science/tel-03172600.
  3. Layered memory automata: Recognizers for quasi-regular languages with unbounded memory. In Luca Bernardinello and Laure Petrucci, editors, Application and Theory of Petri Nets and Concurrency - 43rd International Conference, PETRI NETS 2022, Bergen, Norway, June 19-24, 2022, Proceedings, volume 13288 of Lecture Notes in Computer Science, pages 43–63. Springer, 2022. doi:10.1007/978-3-031-06653-5_3.
  4. Pattern matching in link streams: Timed-automata with finite memory. Sci. Ann. Comput. Sci., 28(2):161–198, 2018. URL: http://www.info.uaic.ro/bin/Annals/Article?v=XXVIII2&a=1.
  5. On notions of regularity for data languages. Theoretical Computer Science, 411(4):702–715, 2010. Fundamentals of Computation Theory. URL: https://www.sciencedirect.com/science/article/pii/S0304397509007518, doi:10.1016/j.tcs.2009.10.009.
  6. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27:1–27:26, 2011. doi:10.1145/1970398.1970403.
  7. The omniscient garbage collector: A resource analysis framework. In 14th International Conference on Application of Concurrency to System Design, ACSD 2014, Tunis La Marsa, Tunisia, June 23-27, 2014, pages 102–111. IEEE Computer Society, 2014. doi:10.1109/ACSD.2014.18.
  8. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic, 10(3), April 2009. doi:10.1145/1507244.1507246.
  9. History-register automata. Log. Methods Comput. Sci., 12(1), 2016. doi:10.2168/LMCS-12(1:7)2016.
  10. Variable automata over infinite alphabets. In Adrian-Horia Dediu, Henning Fernau, and Carlos Martín-Vide, editors, Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings, volume 6031 of Lecture Notes in Computer Science, pages 561–572. Springer, 2010. doi:10.1007/978-3-642-13089-2_47.
  11. Finite-memory automata. Theor. Comput. Sci., 134(2):329–363, 1994. doi:10.1016/0304-3975(94)90242-9.
  12. Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci., 21(5):741–760, 2010. doi:10.1142/S0129054110007532.
  13. Ahmet Kara. Logics on data words: Expressivity, satisfiability, model checking. PhD thesis, Technical University of Dortmund, Germany, 2016. URL: http://hdl.handle.net/2003/35216.
  14. Polynomial-time equivalence testing for deterministic fresh-register automata. In Igor Potapov, Paul G. Spirakis, and James Worrell, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, volume 117 of LIPIcs, pages 72:1–72:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. doi:10.4230/LIPIcs.MFCS.2018.72.
  15. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic, 5(3):403–435, July 2004. doi:10.1145/1013560.1013562.
  16. Intractability of decision problems for finite-memory automata. Theoretical Computer Science, 231(2):297 – 308, 2000. URL: http://www.sciencedirect.com/science/article/pii/S030439759900105X, doi:10.1016/S0304-3975(99)00105-X.
  17. Nikos Tzevelekos. Fresh-register automata. In Thomas Ball and Mooly Sagiv, editors, Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011, pages 295–306. ACM, 2011. doi:10.1145/1926385.1926420.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now