Alfred V. Aho
Jeffrey D. Ullman
Mihalis Yannakakis
1983
On notions of information transfer in VLSI circuits
Johnson
133–139
http://doi.acm.org/10.1145/800061.808742
Jean-Camille Birget
1992
Intersection and union of regular languages and state complexity
Inform. Process. Lett.
43
4
185–190
http://dx.doi.org/10.1016/0020-0190(92)90198-5
Jean-Camille Birget
1993
Partial orders on words, minimal elements of regular languages and state complexity
Theoret. Comput. Sci.
119
2
267–291
http://dx.doi.org/10.1016/0304-3975(93)90160-U
Janusz A. Brzozowski
Galina Jirásková
Baiyu Li
2013
Quotient complexity of ideal languages
Theoret. Comput. Sci.
470
36–52
http://dx.doi.org/10.1016/j.tcs.2012.10.055
Janusz A. Brzozowski
Galina Jirásková
Chenglong Zou
2014
Quotient complexity of closed languages
Theory Comput. Syst.
54
2
277–292
http://dx.doi.org/10.1007/s00224 -013-9515-7
Cezar Câmpeanu
Kai Salomaa
Sheng Yu
2002
Tight lower bound for the state complexity of shuffle of regular languages
J. Autom. Lang. Comb.
7
3
303–310
J.-M. Champarnaud
A. Khorsi
T. Paranthoën
Split and join for minimizing: Brzozowski's algorithm.
http://jmc.feydakins.org/ps/c09psc02.ps
Ian Glaister
Jeffrey Shallit
1996
A lower bound technique for the size of nondeterministic finite automata
Inform. Process. Lett.
59
2
75–77
http://dx.doi.org/10.1016/0020-0190(96)00095-6
Edward A. Hirsch
Juhani Karhumäki
Arto Lepistö
Michail Prilutskii
2012
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings
Lecture Notes in Computer Science
7353
Springer
http://dx.doi.org/10.1007/978-3-642-30642-6
Markus Holzer
Martin Kutrib
2003
Nondeterministic descriptional complexity of regular languages
Internat. J. Found. Comput. Sci.
14
6
1087–1102
http://dx.doi.org/10.1142/S0129054103002199
Juraj Hromkovic
1997
Communication complexity and parallel computing
Springer
http://dx.doi.org/10.1007/978-3-662-03442-2
Galina Jirásková
2005
State complexity of some operations on binary regular languages
Theoret. Comput. Sci.
330
2
287–298
http://dx.doi.org/10.1016/j.tcs.2004.04.011
Galina Jirásková
2012
Descriptional complexity of operations on alternating and boolean automata
Hirsch
196–204
http://dx.doi.org/10.1007/978-3-642-30642-6_19
Galina Jirásková
Tomáš Masopust
2011
Complexity in union-free regular languages
Internat. J. Found. Comput. Sci.
22
7
1639–1653
http://dx.doi.org/10.1142/S0129054111008933
Galina Jirásková
Alexander Okhotin
2008
State complexity of cyclic shift
RAIRO Theor. Inform. Appl.
42
2
335–360
http://dx.doi.org/10.1051/ita:2007038
Galina Jirásková
Juraj Šebej
2012
Reversal of binary regular languages
Theoret. Comput. Sci.
449
85–92
http://dx.doi.org/10.1016/j.tcs.2012.05.008
David S. Johnson
Ronald Fagin
Michael L. Fredman
David Harel
Richard M. Karp
Nancy A. Lynch
Christos H. Papadimitriou
Ronald L. Rivest
Walter L. Ruzzo
Joel I. Seiferas
1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston
ACM
Jui-Yi Kao
Narad Rampersad
Jeffrey Shallit
2009
On NFAs where all states are final, initial, or both
Theoret. Comput. Sci.
410
47-49
5010–5021
http://dx.doi.org/10.1016/j.tcs.2009.07.049
Ernst L. Leiss
1981
Succint representation of regular languages by boolean automata
Theoret. Comput. Sci.
13
323–330
http://dx.doi.org/10.1016/S0304-3975(81)80005-9
A. N. Maslov
1970
Estimates of the number of states of finite automata
Dokl. Akad. Nauk SSSR
194
1266–1268 (Russian)
English translation: Soviet Math. Dokl. 11 (1970) 1373–1375
Tomáš Masopust
2010
Personal communication
B. G. Mirkin
1970
On dual automata
Kibernetika (Kiev)
2
7–10 (Russian)
http://dx.doi.org/10.1007/BF01072247
English translation: Cybernetics 2, (1966) 6–9
Narad Rampersad
2006
The state complexity of L^\voidb@x 2 and L^\voidb@x k
Inform. Process. Lett.
98
6
231–234
http://dx.doi.org/10.1016/j.ipl.2005.06.011
Michael Sipser
1997
Introduction to the theory of computation
PWS Publishing Company
Sheng Yu
Qingyu Zhuang
Kai Salomaa
1994
The state complexities of some basic operations on regular languages
Theoret. Comput. Sci.
125
2
315–328
http://dx.doi.org/10.1016/0304-3975(92)00011-F