Ahmed Bouajjani, Peter Habermehl & Tomás Vojnar (2004):
Abstract Regular Model Checking.
In: Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings,
pp. 372–386,
doi:10.1007/978-3-540-27813-9_29.
Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson & Tayssir Touili (2000):
Regular Model Checking.
In: Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings,
pp. 403–418,
doi:10.1007/10722167_31.
Janusz A. Brzozowski & Edward J. McCluskey (1963):
Signal Flow Graph Techniques for Sequential Circuit State Diagrams.
IEEE Trans. Electron. Comput. 12(2),
pp. 67–76,
doi:10.1109/PGEC.1963.263416.
Loris D'Antoni & Margus Veanes (2017):
The Power of Symbolic Automata and Transducers.
In: Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part I,
pp. 47–67,
doi:10.1007/978-3-319-63387-9_3.
Samuel Eilenberg (1974):
Automata, languages, and machines. A.
Pure and applied mathematics.
Academic Press.
Available at https://www.worldcat.org/oclc/310535248.
Dora Giammarresi & Rosa Montalbano (1999):
Deterministic generalized automata.
Theoretical Computer Science 215(1-2),
pp. 191–208,
doi:10.1016/S0304-3975(97)00166-7.
D. Giannakopoulou & K. Havelund (2001):
Automata-based verification of temporal properties on running programs.
In: Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001),
pp. 412–416,
doi:10.1109/ASE.2001.989841.
Noa Globerman & David Harel (1996):
Complexity Results for Two-Way and Multi-Pebble Automata and their Logics.
Theor. Comput. Sci. 169(2),
pp. 161–184,
doi:10.1016/S0304-3975(96)00119-3.
Yo-Sub Han & Derick Wood (2004):
The Generalization of Generalized Automata: Expression Automata.
In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers,
pp. 156–166,
doi:10.1007/978-3-540-30500-2_15.
David Harel (1987):
Statecharts: A Visual Formalism for Complex Systems.
Sci. Comput. Program. 8(3),
pp. 231–274,
doi:10.1016/0167-6423(87)90035-9.
Kosaburo Hashiguchi (1991):
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language.
In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings,
pp. 641–648,
doi:10.1007/3-540-54233-7_170.
John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman (2007):
Introduction to automata theory, languages, and computation, 3rd Edition.
Pearson international edition.
Addison-Wesley.
Tao Jiang & Bala Ravikumar (1993):
Minimal NFA Problems are Hard.
SIAM J. Comput. 22(6),
pp. 1117–1141,
doi:10.1137/0222067.
Richard M. Karp (1972):
Reducibility Among Combinatorial Problems.
In: Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA,
pp. 85–103,
doi:10.1007/978-1-4684-2001-2_9.
Mehryar Mohri, Pedro J. Moreno & Eugene Weinstein (2009):
General suffix automaton construction algorithm and space bounds.
Theor. Comput. Sci. 410(37),
pp. 3553–3562,
doi:10.1016/j.tcs.2009.03.034.
Margus Veanes, Pieter Hooimeijer, Benjamin Livshits, David Molnar & Nikolaj S. Bjørner (2012):
Symbolic finite state transducers: algorithms and applications.
In: Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012,
pp. 137–150,
doi:10.1145/2103656.2103674.