Authors: Mikołaj Bojańczyk ; Bartek Klin ; Sławomir Lasota
NULL##0000-0001-5793-7425##0000-0001-8674-4470
Mikołaj Bojańczyk;Bartek Klin;Sławomir Lasota
We study languages over infinite alphabets equipped with some structure that
can be tested by recognizing automata. We develop a framework for studying such
alphabets and the ensuing automata theory, where the key role is played by an
automorphism group of the alphabet. In the process, we generalize nominal sets
due to Gabbay and Pitts.
Expressive Power of Tree Logics; Funder: European Commission; Code: 239850
Bibliographic References
52 Documents citing this article
Rindo Nakanishi;Ryoma Senda;Yoshiaki Takata;Hiroyuki Seki, 2023, Pumping Lemmas for Languages Expressed by Computational Models with Registers, IEICE transactions on information and systems, E106.D, 3, pp. 284-293, 10.1587/transinf.2022fcp0004, https://doi.org/10.1587/transinf.2022fcp0004.
Simon Dierl;Falk Howar, Lecture Notes in Computer Science, $$\textsc {Reach}$$ on Register Automata via History Independence, pp. 11-30, 2022, 10.1007/978-3-031-09827-7_2.
Ryoma Senda;Yoshiaki Takata;Hiroyuki Seki, Lecture Notes in Computer Science, Reactive Synthesis from Visibly Register Pushdown Automata, pp. 334-353, 2021, 10.1007/978-3-030-85315-0_19.
Simon Dierl;Falk Howar, Lecture Notes in Computer Science, A Taxonomy and Reductions for Common Register Automata Formalisms, pp. 186-218, 2021, 10.1007/978-3-030-91384-7_10.
Daniel Hausmann;Stefan Milius;Lutz Schröder, A Linear-Time Nominal μ-Calculus with Name Allocation., pp. 18-, 2020, 10.4230/lipics.mfcs.2021.58.
Henning Urbat;Lutz Schröder, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Automata Learning, 2020, Saarbrücken Germany, 10.1145/3373718.3394775.
Lorenzo Clemente, 2020, On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars, arXiv (Cornell University), 320, pp. 29-43, 10.4204/eptcs.320.2.
Hiroyuki Seki;Reo Yoshimura;Yoshiaki Takata, Lecture Notes in Computer Science, Optimal Run Problem for Weighted Register Automata, pp. 91-110, 2019, 10.1007/978-3-030-32505-3_6.
Benedikt Brütsch;Patrick Landwehr;Wolfgang Thomas, Lecture notes in computer science, $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$, pp. 91-102, 2017, 10.1007/978-3-319-53733-7_6.
Eryk Kopczyński;Szymon Toruńczyk, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, LOIS: syntax and semantics, 2017, Paris France, 10.1145/3009837.3009876.
Khadijeh Keshvardoost;Mojgan Mahmoudi, 2017, Free functor from the category of G-nominal sets to that of 01-G-nominal sets, Soft Computing, 22, 11, pp. 3637-3648, 10.1007/s00500-017-2793-2.
Bartek Klin;Michał Szynwelski, 2016, SMT Solving for Functional Programming over Infinite Structures, arXiv (Cornell University), 207, pp. 57-75, 10.4204/eptcs.207.3.
Manuel Bodirsky;Antoine Mottet, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction, 2016, New York NY USA, 10.1145/2933575.2934515.