Author:
Bollig Benedikt,Gastin Paul,Monmege Benjamin,Zeitoun Marc
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. TCS 18(2), 115–148 (1982)
2. Lecture Notes in Computer Science;M. Bojańczyk,2008
3. Lecture Notes in Computer Science;M. Bojańczyk,2006
4. Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Pebble weighted automata and transitive closure logics, http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rapports
5. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. QUANTITATIVE AUTOMATA UNDER PROBABILISTIC SEMANTICS;LOG METH COMPUT SCI;2019
2. Nested Weighted Automata;ACM Transactions on Computational Logic;2017-12-19
3. Quantitative Automata under Probabilistic Semantics;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05
4. Weighted restarting automata;Soft Computing;2016-05-11
5. Quantitative Monitor Automata;Static Analysis;2016