Publisher
Springer International Publishing
Reference15 articles.
1. Bojanczyk, M.: Nominal monoids. Theory Comput. Syst. 53(2), 194–222 (2013)
2. Bedon, N., Rispal, C.: Schützenberger and Eilenberg theorems for words on linear orderings. J. Comput. Syst. Sci. 78(2), 517–536 (2012)
3. Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas], pp. 107–132 (2008)
4. Lecture Notes in Computer Science;O Carton,2011
5. Eilenberg, S.: Automata, languages, and machines, vol. A (1974)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Monadic Monadic Second Order Logic;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. Eilenberg's variety theorem without Boolean operations;Information and Computation;2022-05
3. First-order separation over countable ordinals;Lecture Notes in Computer Science;2022
4. Reiterman’s Theorem on Finite Algebras for a Monad;ACM Transactions on Computational Logic;2021-10-31
5. Learning Pomset Automata;Lecture Notes in Computer Science;2021