@article(Blass:1982:otusp,
 author       = {Andreas Blass and Yuri Gurevich},
 year         = {1982},
 title        = {On the Unique Satisfiability Problem},
 journal      = {Inform. Control},
 volume       = {55},
 pages        = {80--88},
 doi          = {10.1016/S0019-9958(82)90439-9},
)
@article(Chrobak:1986:FAUL,
 author       = {Marek Chrobak},
 year         = {1986},
 title        = {Finite automata and unary languages},
 journal      = {Theor. Comput. Sci.},
 volume       = {47},
 pages        = {149--158},
 doi          = {10.1016/0304-3975(86)90142-8},
 note         = {Errata: \cite{Chrobak:2003:ERRFAUL}},
)
@article(Chrobak:2003:ERRFAUL,
 author       = {Marek Chrobak},
 year         = {2003},
 title        = {Errata to ``Finite automata and unary languages''},
 journal      = {Theor. Comput. Sci.},
 volume       = {302},
 pages        = {497--498},
 doi          = {10.1016/S0304-3975(03)00136-1},
)
@mastersthesis(ellul:2004:dcmrl,
 author       = {Keith Ellul},
 year         = {2004},
 title        = {Descriptional Complexity Measures of Regular Languages},
 school       = {University of Waterloo},
 address      = {Ontario, Canada},
)
@article(geffert:2007:mnshfa,
 author       = {Viliam Geffert},
 year         = {2007},
 title        = {Magic numbers in the state hierarchy of finite automata},
 journal      = {Inform. Comput.},
 volume       = {205},
 number       = {11},
 pages        = {1652--1670},
 doi          = {10.1016/j.ic.2007.07.001},
)
@article(geffert:2003:ctwnuaisa,
 author       = {Viliam Geffert and Carlo Mereghetti and Giovanni Pighizzini},
 year         = {2003},
 title        = {Converting two-way nondeterministic unary automata into simpler automata},
 journal      = {Theor. Comput. Sci.},
 volume       = {295},
 pages        = {189--203},
 doi          = {10.1016/S0304-3975(02)00403-6},
)
@article(hamidoune:1979:slphdlgo,
 author       = {Yahya Ould Hamidoune},
 year         = {1979},
 title        = {Sur les parcours hamiltoniens dans les graphes orientes},
 journal      = {Discrete Mathematics},
 volume       = {26},
 pages        = {227--234},
 doi          = {10.1016/0012-365X(79)90028-1},
)
@book(Hemaspaandra:2002:tctc,
 author       = {Lane A. Hemaspaandra and Mitsunori Ogihara},
 year         = {2002},
 title        = {The Complexity Theory Companion},
 publisher    = {Springer},
 doi          = {10.1007/978-3-662-04880-1},
)
@inproceedings(holzer:2003:ulonsc:proc,
 author       = {Markus Holzer and Martin Kutrib},
 year         = {2003},
 title        = {Unary Language Operations and Their Nondeterministic State Complexity},
 editor       = {M. Ito and M. Toyama},
 booktitle    = {Developments in Language Theory (DLT 2002)},
 series       = {LNCS},
 volume       = {2450},
 publisher    = {Springer},
 pages        = {162--172},
 doi          = {10.1007/3-540-45005-X\_14},
)
@article(holzer:2011:dccfa,
 author       = {Markus Holzer and Martin Kutrib},
 year         = {2011},
 title        = {Descriptional and Computational Complexity of Finite Automata -- {A} Survey},
 journal      = {Inform. Comput.},
 volume       = {209},
 pages        = {456--470},
 doi          = {10.1016/J.IC.2010.11.013},
)
@article(jones:1975:sbracp,
 author       = {Neil D. Jones},
 year         = {1975},
 title        = {Space-Bounded Reducibility among Combinatorial Problems},
 journal      = {J. Comput. Syst. Sci.},
 volume       = {11},
 pages        = {68--85},
 doi          = {10.1016/S0022-0000(75)80050-X},
)
@article(kunc:2012:scotwfaua,
 author       = {Michal Kunc and Alexander Okhotin},
 year         = {2012},
 title        = {State complexity of operations on two-way finite automata over a unary alphabet},
 journal      = {Theor. Comput. Sci.},
 volume       = {449},
 pages        = {106--118},
 doi          = {10.1016/J.TCS.2012.04.010},
)
@inproceedings(kutrib:2023:coenfa:proc,
 author       = {Martin Kutrib and Andreas Malcher and Matthias Wendlandt},
 year         = {2023},
 title        = {Complexity of Exclusive Nondeterministic Finite Automata},
 editor       = {Henning Bordihn and Nicholas Tran and Gy{\"{o}}rgy Vaszil},
 booktitle    = {Descriptional Complexity of Formal Systems (DCFS 2023)},
 series       = {LNCS},
 volume       = {13918},
 publisher    = {Springer},
 pages        = {121--133},
 doi          = {10.1007/978-3-031-34326-1\_9},
)
@article(kutrib:2023:coenfa,
 author       = {Martin Kutrib and Andreas Malcher and Matthias Wendlandt},
 year         = {2024},
 title        = {Complexity of Exclusive Nondeterministic Finite Automata},
 journal      = {submitted for journal publication},
)
@article(Landau:1903:mpgg,
 author       = {Edmund Landau},
 year         = {1903},
 title        = {{\"U}ber die {M}aximalordnung der {P}ermutationen gegebenen {G}rades},
 journal      = {Archiv der Math. und Phys.},
 volume       = {3},
 pages        = {92--103},
)
@book(Landau:1909:hlvp:book,
 author       = {Edmund Landau},
 year         = {1909},
 title        = {Handbuch der {L}ehre von der {V}erteilung der {P}rimzahlen},
 publisher    = {Teubner},
 address      = {Leipzig},
)
@article(leung:1998:seafapafa,
 author       = {Hing Leung},
 year         = {1998},
 title        = {Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata},
 journal      = {SIAM J. Comput.},
 volume       = {27},
 pages        = {1073--1082},
 doi          = {10.1137/S0097539793252092},
)
@article(leung:2005:dcnfada,
 author       = {Hing Leung},
 year         = {2005},
 title        = {Descriptional complexity of {NFA} of different ambiguity},
 journal      = {Int. J. Found. Comput. Sci.},
 volume       = {16},
 pages        = {975--984},
 doi          = {10.1142/S0129054105003418},
)
@article(mera:2005:cunfa,
 author       = {Filippo Mera and Giovanni Pighizzini},
 year         = {2005},
 title        = {Complementing unary nondeterministic automata},
 journal      = {Theor. Comput. Sci.},
 volume       = {330},
 pages        = {349--360},
 doi          = {10.1016/J.TCS.2004.04.015},
)
@article(Mereghetti:2001:osbua,
 author       = {Carlo Mereghetti and Giovanni Pighizzini},
 year         = {2001},
 title        = {Optimal Simulations between Unary Automata},
 journal      = {SIAM J. Comput.},
 volume       = {30},
 pages        = {1976--1992},
 doi          = {10.1137/S009753979935431X},
)
@inproceedings(Meyer:1971:edagfs,
 author       = {Albert R. Meyer and Michael J. Fischer},
 year         = {1971},
 title        = {Economy of Description by Automata, Grammars, and Formal Systems},
 booktitle    = {Symposium on Switching and Automata Theory (SWAT 1971)},
 publisher    = {IEEE},
 pages        = {188--191},
 doi          = {10.1109/SWAT.1971.11},
)
@article(miller:1987:mog,
 author       = {William Miller},
 year         = {1987},
 title        = {The maximum order of an element of a finite symmetric group},
 journal      = {Am. Math. Mon.},
 volume       = {94},
 pages        = {497--506},
 doi          = {10.1080/00029890.1987.12000673},
)
@article(moore:1971:bssspe,
 author       = {Frank R. Moore},
 year         = {1971},
 title        = {On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata},
 journal      = {IEEE Trans. Comput.},
 volume       = {20},
 number       = {10},
 pages        = {1211--1214},
 doi          = {10.1109/T-C.1971.223108},
)
@article(Nicolas:1968:ssn,
 author       = {J.-L. Nicolas},
 year         = {1968},
 title        = {Sur l'ordre maximum d'un \'{e}l\'{e}ment dans le groupe {$S_n$} des permutations},
 journal      = {Acta Arith.},
 volume       = {14},
 pages        = {315--332},
 doi          = {10.4064/aa-14-3-315-332},
)
@article(okhotin:2012:ufau,
 author       = {Alexander Okhotin},
 year         = {2012},
 title        = {Unambiguous finite automata over a unary alphabet},
 journal      = {Inform. Comput.},
 volume       = {212},
 pages        = {15--36},
 doi          = {10.1016/J.IC.2012.01.003},
)
@article(pighizzini:2009:dpdaul:art,
 author       = {Giovanni Pighizzini},
 year         = {2009},
 title        = {Deterministic Pushdown Automata and Unary Languages},
 journal      = {Int. J. Found. Comput. Sci.},
 volume       = {20},
 number       = {4},
 pages        = {629--645},
 doi          = {10.1142/S0129054109006784},
)
@article(pighizzini:2015:ialoaua,
 author       = {Giovanni Pighizzini},
 year         = {2015},
 title        = {Investigations on Automata and Languages Over a Unary Alphabet},
 journal      = {Int. J. Found. Comput. Sci.},
 volume       = {26},
 pages        = {827--850},
 doi          = {10.1142/S012905411540002X},
)
@article(Pighizzini:2002:uloscjf,
 author       = {Giovanni Pighizzini and Jeffrey Shallit},
 year         = {2002},
 title        = {Unary Language Operations, State Complexity and {J}acobsthal's Function},
 journal      = {Int. J. Found. Comput. Sci.},
 volume       = {13},
 pages        = {145--159},
 doi          = {10.1142/S012905410200100X},
)
@article(pighizzini:2002:ucfgpdadcaslb,
 author       = {Giovanni Pighizzini and Jeffrey Shallit and Ming-Wei Wang},
 year         = {2002},
 title        = {Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds},
 journal      = {J. Comput. Syst. Sci.},
 volume       = {65},
 pages        = {393--414},
 doi          = {10.1006/JCSS.2002.1855},
)
@article(Rabin:1959:fadp,
 author       = {Michael Oser Rabin and Dana Scott},
 year         = {1959},
 title        = {Finite Automata and Their Decision Problems},
 journal      = {IBM J. Res. Dev.},
 volume       = {3},
 pages        = {114--125},
 doi          = {10.1147/rd.32.0114},
)
@inproceedings(Sakoda:1978:NST,
 author       = {William J. Sakoda and Michael Sipser},
 year         = {1978},
 title        = {Nondeterminism and the size of two way finite automata},
 editor       = {ACM},
 booktitle    = {Proceedings of the Tenth Annual {ACM} Symposium on Theory of Computing (STOC 1978)},
 organization = {ACM},
 publisher    = {ACM Press},
 address      = {New York},
 pages        = {275--286},
 doi          = {10.1145/800133.804357},
)
@phdthesis(schmidt:1978:sdcfrfl,
 author       = {Erik Meineche Schmidt},
 year         = {1978},
 title        = {Succinctness of Dscriptions of Context-Free, Regular and Finite Languages},
 school       = {Cornell University},
 address      = {Ithaca, NY},
)
@inproceedings(shallit:2008:fpaig,
 author       = {Jeffrey Shallit},
 year         = {2008},
 title        = {The {F}robenius Problem and Its Generalizations},
 editor       = {Masami Ito and Masafumi Toyama},
 booktitle    = {Developments in Language Theory (DLT 2008)},
 series       = {LNCS},
 volume       = {5257},
 publisher    = {Springer},
 pages        = {72--83},
 doi          = {10.1007/978-3-540-85780-8\_5},
)
@article(Sipser:1980:lpssa,
 author       = {Michael Sipser},
 year         = {1980},
 title        = {Lower Bounds on the Size of Sweeping Automata},
 journal      = {J. Comput. Syst. Sci.},
 volume       = {21},
 pages        = {195--202},
 doi          = {10.1016/0022-0000(80)90034-3},
)
@inproceedings(Stockmeyer:1973:WPR,
 author       = {Larry. J. Stockmeyer and A. R. Meyer},
 year         = {1973},
 title        = {Word Problems Requiring Exponential Time},
 editor       = {{ACM}},
 booktitle    = {Proceedings of the Fifth Annual {ACM} Symposium on Theory of Computing (STOC 1973)},
 publisher    = {ACM Press},
 address      = {New York, NY, USA},
 pages        = {1--9},
 doi          = {10.1145/800125.804029},
)
@article(Szalay:1980:mos,
 author       = {M. Szalay},
 year         = {1980},
 title        = {On the maximal order in {$S_n$} and {$S_n^*$}},
 journal      = {Acta Arithm.},
 volume       = {37},
 pages        = {321--331},
 doi          = {10.4064/aa-37-1-321-331},
)
@article(to:2009:ufaap,
 author       = {Anthony Widjaja To},
 year         = {2009},
 title        = {Unary finite automata vs. arithmetic progressions},
 journal      = {Inform. Process. Lett.},
 volume       = {109},
 pages        = {1010--1014},
 doi          = {10.1016/J.IPL.2009.06.005},
)