Büchi automaton (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Büchi automaton" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

69^th place

59^th place

low place

arxiv.org

Schewe, Sven (2010). "Minimisation of Deterministic Parity and Büchi Automata and Relative Minimisation of Deterministic Finite Automata". arXiv:1007.1333 [cs.FL].

Büchi, J.R. (1962). "On a Decision Method in Restricted Second Order Arithmetic". The Collected Works of J. Richard Büchi. Stanford: Stanford University Press. pp. 425–435. doi:10.1007/978-1-4613-8928-6_23. ISBN 978-1-4613-8930-9. {{cite book}}: ISBN / Date incompatibility (help); |journal= ignored (help)
Safra, S. (1988), "On the complexity of ω-automata", Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS '88), Washington DC, US: IEEE Computer Society, pp. 319–327, doi:10.1109/SFCS.1988.21948, ISBN 0-8186-0877-3, S2CID 206559211.
McNaughton, R. (1966), "Testing and generating infinite sequences by a finite automaton", Information and Control, 9 (5): 521–530, doi:10.1016/s0019-9958(66)80013-x.
Sistla, A. P.; Vardi, M. Y.; Wolper, P. (1987), "The complementation problem for Büchi automata with applications to temporal logic", Theoretical Computer Science, 49 (2–3): 217–237, doi:10.1016/0304-3975(87)90008-9.
Kupferman, O.; Vardi, M. Y. (July 2001), "Weak alternating automata are not that weak", ACM Transactions on Computational Logic, 2 (3): 408–429, doi:10.1145/377978.377993.

Safra, S. (1988), "On the complexity of ω-automata", Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS '88), Washington DC, US: IEEE Computer Society, pp. 319–327, doi:10.1109/SFCS.1988.21948, ISBN 0-8186-0877-3, S2CID 206559211.