Editing Regular language (section)

== References ==
{{refbegin}}
* {{cite book | last1=Berstel | first1=Jean | author-link1=Jean Berstel | last2=Reutenauer | first2=Christophe | title=Noncommutative rational series with applications
  | series=Encyclopedia of Mathematics and Its Applications | volume=137 | location=Cambridge | publisher=[[Cambridge University Press]]
  | year=2011 | isbn=978-0-521-19022-0 | zbl=1250.68007 }}
* {{cite book |last1=Eilenberg |first1=Samuel |author-link1=Samuel Eilenberg |title=Automata, Languages, and Machines. Volume A
  |series=Pure and Applied Mathematics |volume=58 |year=1974 |publisher=Academic Press |location=New York |zbl=0317.94045 }}
* {{cite book | first=Arto | last=Salomaa | author-link=Arto Salomaa | title=Jewels of Formal Language Theory | publisher=Pitman Publishing
  | isbn=0-273-08522-0 | year=1981 | zbl=0487.68064 }}
* {{cite book | first=Michael | last=Sipser | author-link = Michael Sipser | year = 1997 | title = Introduction to the Theory of Computation
  | publisher = PWS Publishing | isbn = 0-534-94728-X | zbl=1169.68300 | title-link=Introduction to the Theory of Computation }} Chapter 1: Regular Languages, pp.&nbsp;31–90. Subsection "Decidable Problems Concerning Regular Languages" of section 4.1: Decidable Languages, pp.&nbsp;152–155.
* Philippe Flajolet and Robert Sedgewick, ''[[Analytic Combinatorics]]'': Symbolic Combinatorics.  Online book, 2002.
* {{cite book|author1=John E. Hopcroft |author2=Jeffrey D. Ullman | title=Introduction to Automata Theory, Languages, and Computation| year=1979| publisher=Addison-Wesley| isbn=0-201-02988-X|title-link=Introduction to Automata Theory, Languages, and Computation }}
* {{cite book | author=Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman | title=The Design and Analysis of Computer Algorithms | url=https://archive.org/details/designanalysisof00ahoarich | url-access=registration | publisher=Addison-Wesley | year=1974 | isbn=9780201000290 }}

{{refend}}
{{reflist}}