Author:
Schröder Lutz,Kozen Dexter,Milius Stefan,Wißmann Thorsten
Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)
2. Lecture Notes in Computer Science;M Bielecki,2002
3. Bojańczyk, M.: Automata for data words and data trees. In: Rewriting Techniques and Applications, RTA 2010. LIPIcs, vol. 6, pp. 1–4. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)
4. Bojańczyk, M.: Computation in Sets with Atoms. http://atoms.mimuw.edu.pl/wp-content/uploads/2014/03/main.pdf
5. Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 1–44 (2014)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Coalgebraic Bisimilarity Minimization;Proceedings of the ACM on Programming Languages;2023-01-09
2. Residuality and Learning for Nondeterministic Nominal Automata;Logical Methods in Computer Science;2022-02-03
3. Coalgebraic Semantics for Nominal Automata;Coalgebraic Methods in Computer Science;2022
4. From generic partition refinement to weighted tree automata minimization;Formal Aspects of Computing;2021-08
5. Automata Learning;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08