@proceedings(BKM01, editor = {Roland Backhouse and Dexter Kozen and Bernhard M{\"o}ller}, year = {2001}, title = {Applications of Kleene Algebra}, volume = {01081}, organization = {Dagstuhl-Seminar-Report}, url = {https://www.dagstuhl.de/Reports/01/01081.pdf}, ) @inproceedings(Badr:2008:HO:1428728.1428753, author = {Andrew Badr}, year = {2008}, title = {Hyper-Minimization in {O}($n^2$)}, booktitle = {Proceedings of the 13th International Conference on Implementation and Applications of Automata}, series = {CIAA '08}, publisher = {Springer-Verlag}, address = {Berlin, Heidelberg}, pages = {223--231}, doi = {10.1007/978-3-540-70844-5_23}, ) @article(ITA:8238099, author = {Andrew Badr and Viliam Geffert and Ian Shipman}, year = {2009}, title = {Hyper-minimizing minimized deterministic finite state automata}, journal = {RAIRO - Theoretical Informatics and Applications}, volume = {43}, pages = {69--94}, doi = {10.1051/ita:2007061}, ) @inproceedings(berstel1973densite, author = {Jean Berstel}, year = {1973}, title = {Sur la densit{\'e} asymptotique de langages formels}, booktitle = {International Colloquium on Automata, Languages and Programming (ICALP, 1972)}, organization = {North-Holland}, pages = {345--358}, ) @book(berstel2010codes, author = {Jean Berstel and Dominique Perrin and Christophe Reutenauer}, year = {2010}, title = {Codes and automata}, volume = {129}, publisher = {Cambridge University Press}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9934}, ) @article(buchi1960weak, author = {J Richard B{\"u}chi}, year = {1960}, title = {Weak Second-Order Arithmetic and Finite Automata}, journal = {Mathematical Logic Quarterly}, volume = {6}, number = {1-6}, pages = {66--92}, doi = {10.1002/malq.19600060105}, ) @inproceedings(cook1971complexity, author = {Stephen A Cook}, year = {1971}, title = {The complexity of theorem-proving procedures}, booktitle = {Proceedings of the third annual ACM symposium on Theory of computing}, organization = {ACM}, pages = {151--158}, doi = {10.1145/800157.805047}, ) @inproceedings(DBLP:conf/dlt/HolzerJ12, author = {Markus Holzer and Sebastian Jakobi}, year = {2012}, title = {From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract)}, booktitle = {Developments in Language Theory - 16th International Conference, {DLT} 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings}, pages = {190--201}, doi = {10.1007/978-3-642-31653-1_18}, ) @article(hunt1976equivalence, author = {Harry B Hunt and Daniel J Rosenkrantz and Thomas G Szymanski}, year = {1976}, title = {On the equivalence, containment, and covering problems for the regular and context-free languages}, journal = {Journal of Computer and System Sciences}, volume = {12}, number = {2}, pages = {222--268}, doi = {10.1016/S0022-0000(76)80038-4}, ) @article(immerman1988nondeterministic, author = {Neil Immerman}, year = {1988}, title = {Nondeterministic space is closed under complementation}, journal = {SIAM Journal on computing}, volume = {17}, number = {5}, pages = {935--938}, doi = {10.1137/0217058}, ) @book(immerman2012descriptive, author = {Neil Immerman}, year = {2012}, title = {Descriptive complexity}, publisher = {Springer Science \& Business Media}, doi = {10.1007/978-1-4612-0539-5}, ) @article(jones1975space, author = {Neil D Jones}, year = {1975}, title = {Space-bounded reducibility among combinatorial problems}, journal = {Journal of Computer and System Sciences}, volume = {11}, number = {1}, pages = {68--85}, doi = {10.1016/S0022-0000(75)80050-X}, ) @book(libkin2013elements, author = {Leonid Libkin}, year = {2004}, title = {Elements of finite model theory}, publisher = {Springer Science \& Business Media}, doi = {10.1007/978-3-662-07003-1}, ) @article(lynch1993convergence, author = {James F Lynch}, year = {1993}, title = {Convergence laws for random words}, journal = {Australasian Journal of Combinatorics}, volume = {7}, pages = {145--156}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.5051}, ) @inproceedings(meyer1973word, author = {AR Meyer and LJ Stockmeyer}, year = {1973}, title = {Word problems requiring exponential time}, booktitle = {Proc. STOC}, volume = {73}, pages = {1--9}, doi = {10.1145/800125.804029}, ) @book(muresan2015concrete, author = {M. Muresan}, year = {2009}, title = {A Concrete Approach to Classical Analysis}, series = {CMS Books in Mathematics}, publisher = {Springer New York}, doi = {10.1007/978-0-387-78933-0}, ) @article(pin2010mathematical, author = {Jean-{\'E}ric Pin}, year = {2010}, title = {Mathematical foundations of automata theory}, journal = {Lecture notes LIAFA, Universit{\'e} Paris}, volume = {7}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.1193}, ) @book(sakarovitch2009elements, author = {Jacques Sakarovitch}, year = {2009}, title = {Elements of automata theory}, publisher = {Cambridge University Press}, doi = {10.1017/CBO9781139195218}, ) @book(salomaa2012automata, author = {Arto Salomaa and Matti Soittola}, year = {1978}, title = {Automata-theoretic aspects of formal power series}, publisher = {Springer Science \& Business Media}, doi = {10.1007/978-1-4612-6264-0}, ) @inproceedings(DBLP:journals/corr/Sinya15a, author = {Ryoma Sin'ya}, year = {2015}, title = {An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects}, booktitle = {Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2015, Genoa, Italy, 21-22nd September 2015.}, pages = {172--185}, doi = {10.4204/EPTCS.193.13}, ) @phdthesis(sinya-phd16, author = {Ryoma Sin'ya}, year = {2016}, title = {Zero-One Law for Regular Languages}, type = {{Ph.}{D.} {T}hesis}, school = {Tokyo Insutitute of Technology, Japan}, url = {http://t2r2.star.titech.ac.jp/rrws/file/CTT100701584/ATD100000413/}, ) @article(stockmeyer1974complexity, author = {Larry Joseph Stockmeyer}, year = {1974}, title = {The complexity of decision problems in automata theory and logic}, url = {https://dspace.mit.edu/handle/1721.1/15540}, ) @article(szelepcsenyi1988method, author = {R{\'o}bert Szelepcs{\'e}nyi}, year = {1988}, title = {The method of forced enumeration for nondeterministic automata}, journal = {Acta Informatica}, volume = {26}, number = {3}, pages = {279--284}, doi = {10.1007/BF00299636}, ) @inproceedings(szilard1992characterizing, author = {Andrew Szilard and Sheng Yu and Kaizhong Zhang and Jeffrey Shallit}, year = {1992}, title = {Characterizing regular languages with polynomial densities}, booktitle = {International Symposium on Mathematical Foundations of Computer Science}, organization = {Springer}, pages = {494--503}, doi = {10.1007/3-540-55808-X_48}, ) @article(Thompson:1968:PTR:363347.363387, author = {Ken Thompson}, year = {1968}, title = {Programming Techniques: Regular Expression Search Algorithm}, journal = {Commun. ACM}, volume = {11}, number = {6}, pages = {419--422}, doi = {10.1145/363347.363387}, ) @article(trakhtenbrot1950impossibility, author = {Boris A Trakhtenbrot}, year = {1950}, title = {Impossibility of an algorithm for the decision problem on finite classes (in Russian)}, journal = {Doklady Akademii Nauk SSSR}, volume = {70}, pages = {569--572}, )