References

  1. A. Aho, R. Sethi & J. D. Ullman (1986): Compilers: Principles, Techniques, and Tools. Addison Wesley.
  2. A. V. Aho, J. E. Hopcroft & J. D. Ullman (1974): The Design and Analysis of Computer Algorithms. Addision-Wesley.
  3. A. V. Aho & J. D. Ullman (1972): The Theory of Parsing, Translation and Compiling I. Prentice-Hall.
  4. V. Antimirov (1996): Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155(2), pp. 291–319, doi:10.1016/0304-3975(95)00182-4.
  5. D. N. Arden (1961): Delayed-Logic and Finite-State Machines. In: T. Mott: Proceedings of the 1st and 2nd Annual Symposium on Switching Theory and Logical Design. American Institute of Electrical Engineers, New York, Detroit, Michigan, USA, pp. 133–151, doi:10.1109/FOCS.1961.13.
  6. A. Asperti, C. Sacerdoti Coen & E. Tassi (2010): Regular Expressions, au point. arXiv:1010.2604v1 [cs.FL].
  7. G. Berry & R. Sethi (1986): From Regular Expressions to Deterministic Automata. Theoretical Computer Science 48(3), pp. 117–126, doi:10.1016/0304-3975(86)90088-5.
  8. Ph. Bille & M. Thorup (2010): Regular Expression Matching with Multi-Strings and Intervals. In: M. Charikar: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Austin, Texas, USA, pp. 1297–1308, doi:10.1137/1.9781611973075.104.
  9. R. V. Book & A. K. Chandra (1976): Inherently Nonplanar Automata. Acta Informatica 6(1), pp. 89–94, doi:10.1007/BF00263745.
  10. S. Broda, A. Machiavelo, N. Moreira & R. Reis (2010): On the Average Number of States of Partial Derivative Automata. In: Y. Gao, H. Lu, S. Seki & S. Yu: Proceedings of the 14th International Conference Developments in Language Theory, LNCS 6224. Springer, London, Ontario, Canada, pp. 112–123, doi:10.1007/978-3-642-14455-4_12.
  11. S. Broda, A. Machiavelo, N. Moreira & R. Reis (2012): On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science 23(5), pp. 969–984, doi:10.1142/S0129054112400400.
  12. S. Broda, A. Machiavelo, N. Moreira & R. Reis (2014): A Hitchhiker's Guide to Descriptional Complexity Through Analytic Combinatorics. Theoretical Computer Science 528, pp. 85–100, doi:10.1016/j.tcs.2014.02.013.
  13. A. Brüggemann-Klein (1993): Regular Expressions into Finite Automata. Theoretical Computer Science 120, pp. 197–213, doi:10.1016/0304-3975(93)90287-4.
  14. J. A. Brzozowski (1964): Derivatives of regular expressions. Journal of the ACM 11, pp. 481–494, doi:10.1145/321239.321249.
  15. J. A. Brzozowski & E. J. McCluskey (1963): Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Computers C-12(2), pp. 67–76, doi:10.1109/PGEC.1963.263416.
  16. P. Caron & D. Ziadi (2000): Characterization of Glushkov automata. Theoretical Computer Science 233(1–2), pp. 75–90, doi:10.1016/S0304-3975(97)00296-X.
  17. J.-M. Champarnaud, F. Ouardi & D. Ziadi (2007): Normalized Expressions and Finite Automata. International Journal of Algebra and Computation 17(1), pp. 141–154, doi:10.1142/S021819670700355X.
  18. J.-M. Champarnaud & D. Ziadi (2002): Canonical derivatives, partial derivatives and finite automaton constructions. Theoretical Computer Science 289(1), pp. 137–163, doi:10.1016/S0304-3975(01)00267-5.
  19. C.H. Chang & R. Paige (1992): From Regular Expressions to DFA's Using Compressed NFA's. In: A. Apostolico, M. Chrochemore, Z. Galil & U. Manber: Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, LNCS 644. Springer, Tucson, Arizon, USA, pp. 90–110, doi:10.1007/3-540-56024-6_8.
  20. H. Chen (2010): Finite Automata of Expressions in the Case of Star Normal Form and One-Unambiguity. Technical Report ISCAS-LCS-10-11. Chinese Academy of Sciences, Institute of Software, State Key Laboratory of COmputer Science, Beijing 100190 China.
  21. M. Chrobak (1986): Finite automata and unary languages. Theoretical Computer Science 47, pp. 149–158, doi:10.1016/0304-3975(86)90142-8.
  22. J. H. Conway (1971): Regular Algebra and Finite Machines. Chapman and Hall.
  23. M. Delgado & J. Morais (2004): Approximation to the Smallest Regular Expression for a Given Regular Language. In: M. Domaratzki, A. Okhotin, K. Salomaa & S. Yu: Proceedings of the 9th Conference on Implementation and Application of Automata, LNCS 3317. Springer, Kingston, Ontario, Canada, pp. 312–314, doi:10.1007/978-3-540-30500-2_31.
  24. D.-Z. Du & K.-I. Ko (2001): Problem Solving in Automata, Languages, and Complexity. John Wiley & Sons, doi:10.1002/0471224642.
  25. K. Edwards & G. Farr (2012): Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. The Electronic Journal of Combinatorics 19(2), pp. #P25.
  26. L. C. Eggan (1963): Transition graphs and the star height of regular events. Michigan Mathematical Journal 10, pp. 385–397, doi:10.1307/mmj/1028998975.
  27. A. Ehrenfeucht & H. P. Zeiger (1976): Complexity Measures for Regular Expressions. Journal of Computer and System Sciences 12(2), pp. 134–146, doi:10.1016/S0022-0000(76)80034-7.
  28. K. Ellul, B. Krawetz, J. Shallit & M.-W. Wang (2004): Regular Expressions: New Results and Open Problems. Journal of Automata, Languages and Combinatorics 9(2/3), pp. 233–256.
  29. Ph. Flajolet & R. Sedgewick (2009): Analytic Combinatorics. Cambridge University Press, doi:10.1017/CBO9780511801655.
  30. Y. Gao, K. Salomaa & S. Yu (2011): Transition Complexity of Incomplete DFAs. Fundamenta Informaticae 110(1–4), pp. 143–158.
  31. P. García, D. López, J. Ruiz & G. I. Álvarez (2011): From regular expressions to smaller NFAs. Theoretical Computer Science 412, pp. 5802–5807, doi:10.1016/j.tcs.2011.05.058.
  32. P. Gawrychowski (2011): Chrobak Normal Form Revisited, with Applications. In: B. Bouchou-Markhoff, P. Caron, J.-M. Champarnaud & D. Maurel: Proceedings of the 16th Conference on Implementation and Application of Automata, LNCS 6807. Springer, Blois, France, pp. 142–153, doi:10.1007/978-3-642-22256-6_14.
  33. V. Geffert (2003): Translation of binary regular expressions into nondeterministic ε-free automata with O(nologn) transitions. Journal of Computer and System Sciences 66(3), pp. 451–472, doi:10.1016/S0022-0000(03)00036-9.
  34. W. Gelade (2010): Succintness of regular expressions with interleaving, intersection, and counting. Theoretical Computer Science 411(31–33), pp. 2987–2998, doi:10.1016/j.tcs.2010.04.036.
  35. W. Gelade & F. Neven (2008): Succinctness of Complement and Intersection of Regular Expressions. In: S. Albers & P. Weil: Proceedings of the 25th International Symposium on Theoretical Aspects of Compter Science, Leibniz International Proceedings in Informatics 1. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, Bordeaux, France, pp. 325–336.
  36. D. Giammarresi, J.-L. Ponty, D. Wood & D. Ziadi (2004): A Characterization of Thompson Digraphs. Discrete Applied Mathematics 134(1–3), pp. 317–337, doi:10.1016/S0166-218X(03)00299-3.
  37. D. Giammarresi, J.-L. Pony & D. Wood (1999): Thompson Languages. In: J. Karhumäki, H. Maurer, G. Păun & G. Rozenberg: Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa. Springer, pp. 16–24, doi:10.1007/978-3-642-60207-8_2.
  38. V. M. Glushkov (1961): The abstract theory of automata. Russian Mathematics Surveys 16, pp. 1–53, doi:10.1070/RM1961v016n05ABEH004112.
  39. J. Goldstine, M. Kappes, C. M. R. Kintala, H. Leung, A. Malcher & D. Wotschke (2002): Descriptional Complexity of Machines with Limited Resources. Journal of Universal Computer Science 8(2), pp. 193–234, doi:10.1142/9781848165458_0001.
  40. J. Goldstine, C. M. R. Kintala & D. Wotschke (1990): On Measuring Nondeterminism in Regular Languages. Information and Computation 86(2), pp. 179–194, doi:10.1016/0890-5401(90)90053-K.
  41. J. Goldstine, H. Leung & D. Wotschke (1992): On the relation between amibuity and nondeterminism in finite automata. Information and Computation 100, pp. 261–170, doi:10.1016/0890-5401(92)90014-7.
  42. H. Gruber & St. Gulan (2010): Simplifying Regular Expressions. In: A. H. Dediu, H. Fernau & C. Martín-Vide: Proceedings of the 4th International Conference Language and Automata Theory and Applications, LNCS 6031. Springer, Trier, Germany, pp. 285–296, doi:10.1007/978-3-642-13089-2_24.
  43. H. Gruber & M. Holzer (2008): Finite Automata, Digraph Connectivity, and Regular Expression Size. In: L. Aceto, I. Damgaard, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir & I. Walkuwiewicz: Proceedings of the 35th International Colloquium on Automata, Languages and Propgramming, LNCS 5126. Springer, Reykjavik, Iceland, pp. 39–50, doi:10.1007/978-3-540-70583-3_4.
  44. H. Gruber & M. Holzer (2008): Provably Shorter Regular Expressions from Deterministic Finite Automata (Extended Abstract). In: M. Ito & M. Toyama: Proceedings of the 12th International Conference Developments in Language Theory, LNCS 5257. Springer, Kyoto, Japan, pp. 383–395, doi:10.1007/978-3-540-85780-8_30.
  45. H. Gruber & M. Holzer (2009): Tight Bounds on the Descriptional Complexity of Regular Expressions. In: V. Diekert & D. Nowotka: Proceedings of the 13th International Conference Developments in Language Theory, LNCS 5583. Springer, Stuttgart, Germany, pp. 276–287, doi:10.1007/978-3-642-02737-6_22.
  46. H. Gruber & M. Holzer (2013): Provably Shorter Regular Expressions From Finite Automata. International Journal of Foundations of Computer Science 24(8), pp. 1255–1279, doi:10.1142/S0129054113500330.
  47. H. Gruber & M. Holzer (2014): Regular Expressions From Deterministic Finite Automata, Revisited. IFIG Research Report 1403. Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany.
  48. H. Gruber, M. Holzer & M. Tautschnig (2009): Short Regular Expressions from Finite Automata: Empirical Results. In: S. Maneth: Proceedings of the 14th Conference on Implementation and Application of Automata, LNCS 5642. Springer, Sydney, Australia, pp. 188–197, doi:10.1007/978-3-642-02979-0_22.
  49. H. Gruber & J. Johannsen (2008): Tight Bounds on the Descriptional Complexity of Regular Expressions. In: R. Amadio: Proceedings of the 11th Conference Foundations of Software Science and Computational Structures, LNCS 4962. Springer, Budapest, Hungary, pp. 273–286, doi:10.1007/978-3-540-78499-9_20.
  50. H. Gruber, J. Lee & J. Shallit (2012): Enumerating regular expressions and their languages. arXiv:1204.4982 [cs.FL].
  51. St. Gulan & H. Fernau (2008): An Optimal Comstruction of Finite Automata From Regular Expressions. In: R. Hariharan, M. Mukund & V. Vinay: Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Compter Science, Dagstuhl Seminar Proceedings 08002. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, Bangalore, India, pp. 211–222.
  52. Ch. Hagenah & A. Muscholl (2000): Computing ε-free NFA from regular expressions in O(nolog^2(n)) time. RAIRO–Informatique théorique et Applications / Theoretical Informatics and Applications 34(5), pp. 257–277, doi:10.1051/ita:2000116.
  53. Y.-S. Hand & D. Wood (2007): Obtaining shorter regular expressions from finite-state automata. Theoretical Computer Science 370(1–3), pp. 110–120, doi:10.1016/j.tcs.2006.09.025.
  54. K. Hashiguchi (1988): Algorithms for determining the relative star height and star height. Information and Computation 78(2), pp. 124–169, doi:10.1016/0890-5401(88)90033-8.
  55. M. Holzer & S. Jakobi (2011): Chop Operations and Expressions: Descriptional Complexity Considerations. In: G. Mauri & A. Leporati: Proceedings of the 15th International Conference Developments in Language Theory, LNCS 6795. Springer, Milan, Italy, pp. 264–275, doi:10.1007/978-3-642-22321-1_23.
  56. M. Holzer & M. Kutrib (2009): Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity. International Journal of Foundations of Computer Science 20(4), pp. 563–580, doi:10.1142/S0129054109006747.
  57. M. Holzer & M. Kutrib (2010): The Complexity of Regular(-Like) Expressions. In: Y. Gao, H. Lu, S. Seki & S. Yu: Proceedings of the 14th International Conference Developments in Language Theory, LNCS 6224. Springer, London, Ontario, Canada, pp. 16–30, doi:10.1007/978-3-642-14455-4_3.
  58. M. Holzer & M. Kutrib (2010): Descriptional Complexity—An Introductory Survey. In: C. Martín-Vide: Scientific Applications of Language Methods. World Scientific, pp. 1–58, doi:10.1142/9781848165458_0001.
  59. M. Holzer & M. Kutrib (2010): Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. In: A. Kucera & I. Potapov: Proceedings of the 4th Workshop on Reachability Problems, LNCS 6227. Springer, Brno, Czech Republic, pp. 1–23, doi:10.1007/978-3-642-15349-5_1.
  60. M. Holzer & M. Kutrib (2011): Descriptional and Computational Complexity of Finite Automata—A Survey. Information and Computation 209(3), pp. 456–470, doi:10.1016/j.ic.2010.11.013.
  61. J. E. Hopcroft & J. D. Ullman (1979): Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
  62. J. Hromkovič (2002): Descriptional Complexity of Finite Automata: Concepts and Open Problems. Journal of Automata, Languages and Combinatorics 7(4), pp. 519–531.
  63. J. Hromkovič, J. Karhumäki, H. Klauck, G. Schnitger & S. Seibert (2002): Communication complexity method for measuring nondeterminism in finite automata. Information and Computation 172(2), pp. 202–217, doi:10.1006/inco.2001.3069.
  64. J. Hromkovič & G. Schnitger (2005): NFAs with and without ε-transitions. In: L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung: Proceedings of the 32nd International Colloquium Automata, Languages and Programming, LNCS 3580. Springer, Lisbon, Portugal, pp. 385–396, doi:10.1007/11523468_32.
  65. J. Hromkovič, S. Seibert & Th. Wilke (2001): Translating Regular Expressions into Small ε-Free Automata. Journal of Computer and System Sciences 62(4), pp. 565–588, doi:10.1006/jcss.2001.1748.
  66. L. Ilie & S. Yu (2003): Follow automata. Information and Computation 186(1), pp. 140–162, doi:10.1016/S0890-5401(03)00090-7.
  67. D. Kirsten (2005): Distance desert automata and the star height problem. RAIRO–Informatique théorique et Applications / Theoretical Informatics and Applications 39(3), pp. 455–509, doi:10.1051/ita:2005027.
  68. S. C. Kleene (1956): Representation of events in nerve nets and finite automata. In: C. E. Shannon & J. McCarthy: Automata studies, Annals of mathematics studies 34. Princeton University Press, pp. 2–42.
  69. E. Leiss (1981): The complexity of restricted regular expressions and the synthesis problem for finite automata. Journal of Computer and System Sciences 23(3), pp. 348–254, doi:10.1016/0022-0000(81)90070-2.
  70. H. Leung (1998): On Finite Automata with Limited Nondeterminism. Acta Informatica 35(7), pp. 595–624, doi:10.1007/s002360050133.
  71. H. Leung (1998): Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM Journal on Computing 27(4), pp. 1073–1082, doi:10.1137/S0097539793252092.
  72. H. Leung (2005): Descriptional complexity of NFA of different ambiguity. International Journal of Foundations of Computer Science 16(5), pp. 975–984, doi:10.1142/S0129054105003418.
  73. Y. Lifshits (2003): A lower bound on the size of ε-free NFA corresponding to a regular expression. Information Processing Letters 85(6), pp. 293–299, doi:10.1016/S0020-0190(02)00436-2.
  74. S. Lombardy, Y. Régis-Gianas & J. Sakarovitch (2004): Introducing VAUCANSON. Theoretical Computer Science 328(1–2), pp. 77–96, doi:10.1016/j.tcs.2004.07.007.
  75. E. Maia, N. Moreira & R. Reis (2013): Incomplete Transition Complexity of Basic Operations on Finite Languages. In: S. Konstantinidis: Proceedings of the 18th International Conference on Implementation and Application of Automata, LNCS 7982. Springer, Halifax, Nova Scotia, Canada, pp. 349–356, doi:10.1007/978-3-642-39274-0_31.
  76. E. Maia, N. Moreira & R. Reis (2013): Incomplete Transition Complexity of Some Basic Operations. In: P. v. Emde Boas, F. C. A. Groen, G. F. Italiano, J. R. Nawrocki & H. Sack: Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, LNCS 7741. Springer, Špindlerøuv Mlýn, Czech Republic, pp. 319–331.
  77. Z. Manna (1974): Mathematical Theory of Computation. McGraw-Hill.
  78. A. Martinez (2002): Efficient Computation of Regular Expressions from Unary NFAs. In: J. Dassow, M. Hoeberechts, H. Jürgensen & D. Wotschke: Pre-Proceedings of the 4th Workshop on Descriptional Complexity of Formal Systems, Report No. 586. Department of Computer Science, The University of Western Ontario, Canada, London, Ontario, Canada, pp. 216–230.
  79. H. V. McIntosh (1968): REEX: A CONVERT Program to Realize the McNaughton-Yamada Analysis Algorithm. Technical Report AIM-153. MIT Artificial Intelligence Laboratory.
  80. R. McNaughton (1967): The loop complexity of pure-group events. Information and Control 11(1–2), pp. 167–176, doi:10.1016/S0019-9958(67)90481-0.
  81. R. McNaughton (1969): The loop complexity of regular events. Information Sciences 1, pp. 305–328, doi:10.1016/S0020-0255(69)80016-2.
  82. R. McNaughton (1982): Elementary computability, formal languages, and automata. Prentice-Hall.
  83. Robert McNaughton & Hisao Yamada (1960): Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers EC-9(1), pp. 39–47, doi:10.1109/TEC.1960.5221603.
  84. A. R. Meyer & M. J. Fischer (1971): Economy of description by automata, grammars, and formal systems. In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory. IEEE Computer Society Press, pp. 188–191, doi:10.1109/T-C.1971.223108.
  85. B. G. Mirkin (1966): An Algorithm for Constructing a Base in a Language of Regular Expressions. Engineering Cybernetics 5, pp. 110–116.
  86. F. R. Moore (1971): On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transaction on Computing C-20, pp. 1211–1219, doi:10.1109/T-C.1971.223108.
  87. N. Moreira, D. Nabais & R. Reis (2010): State Elimination Ordering Strategies: Some Experimental Results. In: I. McQuillan & G. Pighizzini: Proceedings of the 12th Workshop on Descriptional Complexity of Formal Systems, EPTCS 31, Saskatoon, Saskatchewan, Canada, pp. 139–148.
  88. N. Moreira & R. Reis (2009): Series-Parallel Automata and Short Regular Expressions. Fundamenta Informaticae 91(3–4), pp. 611–629.
  89. C. Nicaud (2009): On the Average Size of Glushov's Automaton. In: A. H. Dediu, A. M. Ionescu & C. Martín-Vide: Proceedings of the 3rd International Conference Language and Automata Theory and Applications, LNCS 5457. Springer, Tarragona, Spain, pp. 626–637, doi:10.1007/978-3-642-00982-2_53.
  90. C. Nicaud, C. Pivoteau & B. Razet (2010): Average Analysis of Glushkov Automata under a BST-Like Model. In: K. Lodaya & M. Mahajan: Proceedings of the 30th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Leibniz International Proceedings in Informatics 8. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, Chennai, India, pp. 388–399.
  91. G. Ott & N. H. Feinstein (1961): Design of Sequential Machines From Their Regular Expressions. Journal of the ACM 8(4), pp. 585–600, doi:10.1145/321088.321097.
  92. A. Palioudakis, K. Salomaa & S. Akl (2013): Comparisons Between Measures of Nondeterminism on Finite Automata. In: H. Jürgensen & R. Reis: Proceedings of the 15th International Workshop Descriptional Complexity of Formal Systems, LNCS 8031. Springer, London, Ontario, Canada, pp. 229–240, doi:10.1007/978-3-642-39310-5_21.
  93. A. Palioudakis, K. Salomaa & S. G. Akl (2012): State Complexity and Limited Nondeterminism. In: M. Kutrib, N. Moreira & R. Reis: Proceedings of the 14th Workshop on Descriptional Complexity of Formal Systems, LNCS 7386. Springer, Braga, Portugal, pp. 252–265, doi:10.1007/978-3-642-31623-4_20.
  94. M. O. Rabin & D. Scott (1959): Finite Automata and Their Decision Problems. IBM Journal of Research and Development 3, pp. 114–125, doi:10.1147/rd.32.0114.
  95. B. Ravikumar & O. H. Ibarra (1989): Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. SIAM Journal on Computing 18(6), pp. 1263–1282, doi:10.1137/0218083.
  96. F. Reidl, P. Rossmanith, F. Sánchez Villaamil & S. Sikdar (2014): A Faster Parameterized Algorithm for Treedepth. arXiv:1401.7540v3 [cs.DS].
  97. J. Sakarovitch (2009): Elements of Automata Theory. Cambridge University Press, doi:10.1017/CBO9781139195218.
  98. G. Schnitger (2006): Regular Expressions and NFAs Without ε-Transitions. In: B. Durand & W. Thomas: Proceedings of the 23th International Symposium on Theoretical Aspects of Computer Science, LNCS 3884. Springer, Marseille, France, pp. 432–443.
  99. S. Sippu & E. Soisalon-Soininen (1988): Parsing Theory, Volume I: Languages and Parsing. EATCS Monographs on Theoretical Computer Science 15. Springer, doi:10.1007/978-3-642-61345-6.
  100. K. Thompson (1968): Regular Expression Search Algorithm. Communications of the ACM 11(6), pp. 419–422, doi:10.1145/363347.363387.
  101. A. W. To (2009): Unary finite automata vs. arithmetic progressions. Information Processing Letters 109(17), pp. 1010–1014, doi:10.1016/j.ipl.2009.06.005.
  102. B. W. Watson (1995): Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis. Eindhoven University of Technology, Department of Mathematics and Computer Science, Den Dolech 2, 5612 AZ Eindhoven, The Netherlands.
  103. S. Yu (2001): State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6, pp. 221–234.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org