Marco Almeida, Nelma Moreira & Rogério Reis (2008):
Exact generation of minimal acyclic deterministic finite automata.
Int. J. Found. Comput. S. 19(4),
pp. 751–765,
doi:10.1142/S0129054108005930.
Cezar Câmpeanu, Karel Culik II, Kai Salomaa & Sheng Yu (2001):
State Complexity of Basic Operations on Finite Languages.
In: Oliver Boldt & Helmut Jürgensen: 4th WIA'99,
LNCS 2214.
Springer-Verlag,
pp. 60–70,
doi:10.1007/3-540-45526-4_6.
Cezar Câmpeanu & Wing Hong Ho (2004):
The Maximum State Complexity for Finite Languages.
J. Autom. Lang. Comb. 9(2-3),
pp. 189–202.
Guilherme Duarte, Nelma Moreira, Luca Prigioniero & Rogério Reis (2024):
Block Languages and their Bitmap Representations.
Submitted.
Yuan Gao, Nelma Moreira, Rogério Reis & Sheng Yu (2017):
A Survey on Operational State Complexity.
Journal of Automata, Languages and Combinatorics 21(4),
pp. 251–310.
Yo-Sub Han & Kai Salomaa (2008):
State Complexity of Union and Intersection of Finite Languages.
Int. J. Found. Comput. Sci. 19(3),
pp. 581–595,
doi:10.1142/S0129054108005838.
Markus Holzer & Martin Kutrib (2003):
State Complexity of Basic Operations on Nondeterministic Finite Automata.
In: Jean-Marc Champarnaud & Denis Maurel: 7th CIAA 2002,
LNCS 2608.
Springer-Verlag,
pp. 148–157,
doi:10.1007/3-540-44977-9_14.
Juhani Karhumäki & Jarkko Kari (2021):
Finite automata, image manipulation, and automatic real functions.
In: Jean-Éric Pin: Handbook of Automata Theory.
European Mathematical Society,
pp. 1105–1143,
doi:10.4171/AUTOMATA-2/8.
Juhani Karhumäki & Alexander Okhotin (2014):
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.
In: R. Freivalds C. S. Calude & K. Iwama: Computing with New Resources - Essays Dedicated to Jozef Gruska,
LNCS 8808.
Springer,
pp. 71–82,
doi:10.1007/978-3-319-13350-8_6.
Stavros Konstantinidis, Nelma Moreira & Rogério Reis (2018):
Randomized Generation Of Error Control Codes With Automata And Transducers.
RAIRO 52,
pp. 169–184.
Diaconis Persi, Graham R. L. & Kantor William.M. (1983):
The mathematics of perfect shuffles.
Advances in Applied Mathematics 4,
pp. 175–196,
doi:10.1016/0196-8858(83)90009-X.
Dominique Revuz (1992):
Minimisation of acyclic deterministic automata in linear time.
Theoret. Comput. Sci. 92(1),
pp. 181–189,
doi:10.1016/0304-3975(92)90142-3.
Kai Salomaa & Sheng Yu (1997):
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.
J. Autom. Lang. Comb. 2(3),
pp. 177–186.
Sheng Yu, Qingyu Zhuang & Kai Salomaa (1994):
The State Complexities of Some Basic Operations on Regular Languages.
Theor. Comput. Sci. 125(2),
pp. 315–328,
doi:10.1016/0304-3975(92)00011-F.