![Weak Second‐Order Arithmetic and Finite Automata - Büchi - 1960 - Mathematical Logic Quarterly - Wiley Online Library Weak Second‐Order Arithmetic and Finite Automata - Büchi - 1960 - Mathematical Logic Quarterly - Wiley Online Library](https://onlinelibrary.wiley.com/cms/asset/70b69499-6154-499b-8851-4e87e3e47b04/malq.19600060105.fp.png)
Weak Second‐Order Arithmetic and Finite Automata - Büchi - 1960 - Mathematical Logic Quarterly - Wiley Online Library
![PDF) Conversion of Decision Tree Into Deterministic Finite Automaton for High Accuracy Online SYN Flood Detection PDF) Conversion of Decision Tree Into Deterministic Finite Automaton for High Accuracy Online SYN Flood Detection](https://i1.rgstatic.net/publication/292551428_Conversion_of_Decision_Tree_Into_Deterministic_Finite_Automaton_for_High_Accuracy_Online_SYN_Flood_Detection/links/58569aa208ae8f695558a0df/largepreview.png)
PDF) Conversion of Decision Tree Into Deterministic Finite Automaton for High Accuracy Online SYN Flood Detection
![Mathematics | Free Full-Text | Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game Mathematics | Free Full-Text | Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game](https://www.mdpi.com/mathematics/mathematics-06-00020/article_deploy/html/images/mathematics-06-00020-g002.png)
Mathematics | Free Full-Text | Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game
![Distributed Graph Automata | Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Distributed Graph Automata | Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)](https://dl.acm.org/cms/asset/a14b551f-5e4e-4c05-8a0b-11e7f77d791c/lics.2015.27.fp.png)
Distributed Graph Automata | Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
![Information | Free Full-Text | A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata Information | Free Full-Text | A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata](https://pub.mdpi-res.com/information/information-09-00314/article_deploy/html/images/information-09-00314-g006.png?1570800857)
Information | Free Full-Text | A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata
![Introduction to the Theory of Computation Fall Semester, School of Information, Renmin University of China. - ppt download Introduction to the Theory of Computation Fall Semester, School of Information, Renmin University of China. - ppt download](http://images.slideplayer.com/25/7719658/slides/slide_16.jpg)
Introduction to the Theory of Computation Fall Semester, School of Information, Renmin University of China. - ppt download
Implementation and Application of Automata: 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings | SpringerLink
![Nondeterminism and the size of two way finite automata | Proceedings of the tenth annual ACM symposium on Theory of computing Nondeterminism and the size of two way finite automata | Proceedings of the tenth annual ACM symposium on Theory of computing](https://dl.acm.org/cms/asset/45d9d5cf-67b9-4630-b368-e2f3b5924495/800133.804357.fp.png)