<p><a href="https://www.google.co.in/books/edition/An_Introduction_to_Formal_Languages_and/hsxDiWvVdBcC?hl=en&gbpv=1&dq=right+quotient+automata&pg=PA104&printsec=frontcover#v=onepage&q=right%20quotient%20automata&f=false" rel="nofollow noreferrer"> An Introduction to formal Languages and Automata </a></p>
<p><a href="http://www.cs.nott.ac.uk/~psznhn/G52LAC/" rel="nofollow noreferrer">Included in the University of Nottingham's Languages and Computation Course resources</a></p>
<blockquote>
<p>The book An Introduction to Formal Languages and Automata  by Peter Linz can be used as an alternative or complement to Hopcroft-Motwani-Ullman.</p>
</blockquote>
<p><a href="https://dl.acm.org/doi/book/10.5555/1206580" rel="nofollow noreferrer">An excerpt from</a></p>
<blockquote>
<p>The latest edition of Linz’s theory textbook follows the same outline as the previous one: it begins with a chapter on mathematical preliminaries; moves through the Chomsky hierarchy (regular, context-free, and recursively enumerable languages, with a brief mention of context-sensitive languages); and concludes with one chapter each on the topics of undecidability, alternate models of computation, and complexity classes.</p>
</blockquote>
<blockquote>
<p>The presentation suits your needs : gives formal definitions, provide examples, give mathematical justifications (usually complete proofs), and end with a set of exercises. Solutions to some of the exercises appear in the appendix.</p>
</blockquote>
<blockquote>
<p>More than anything else, the book needs to provide readers with a broader framework that naturally motivates the many topics covered. Instructors looking for a general reference on automata and formal languages, or a textbook for a mathematically sophisticated audience, should take note that Linz’s book lacks a comprehensive bibliography (the one-page list of references consists primarily of other theory textbooks).</p>
</blockquote>
<blockquote>
<p>Overall, the work is appropriate for the author’s stated purpose: a textbook for an introductory undergraduate course on the theory of computation—provided that the students have sufficient mathematical preparation.</p>
</blockquote>

CC BY-SA 4.0
2020-12-18T03:14:26.127Z
2020-12-18T03:58:21.423Z
2020-12-18T03:58:21.423Z
Neelesh V
<p>In Hopcroft-Motwani-Ullman there are exercises on this topic. What is another good reference (textbook/website) for fractional/quotient regular languages, possibly with examples?</p>

CC BY-SA 4.0
2020-12-18T03:38:47.517Z
I've never heard of "Fractional languages" -- what are they?
Ben I.
<cs-theory><complexity-theory>
Any materials on fractional/quotient languages?
# Any materials on fractional/quotient languages?

(Asked by: username_0 on 2020-09-18)

In Hopcroft-Motwani-Ullman there are exercises on this topic. What is another good reference (textbook/website) for fractional/quotient regular languages, possibly with examples?

**Tags:** cs-theory, complexity-theory

> **Comments:**
> **username_1**: I've never heard of "Fractional languages" -- what are they?  

---

## 1 answers

### Answer by username_2 on 2020-12-18. Score: 1

[An Introduction to formal Languages and Automata](https://www.google.co.in/books/edition/An_Introduction_to_Formal_Languages_and/hsxDiWvVdBcC?hl=en&gbpv=1&dq=right+quotient+automata&pg=PA104&printsec=frontcover#v=onepage&q=right%20quotient%20automata&f=false)

[Included in the University of Nottingham's Languages and Computation Course resources](http://www.cs.nott.ac.uk/~psznhn/G52LAC/)

> The book An Introduction to Formal Languages and Automata by Peter Linz can be used as an alternative or complement to Hopcroft-Motwani-Ullman.

[An excerpt from](https://dl.acm.org/doi/book/10.5555/1206580)

> The latest edition of Linz’s theory textbook follows the same outline as the previous one: it begins with a chapter on mathematical preliminaries; moves through the Chomsky hierarchy (regular, context-free, and recursively enumerable languages, with a brief mention of context-sensitive languages); and concludes with one chapter each on the topics of undecidability, alternate models of computation, and complexity classes.

> The presentation suits your needs : gives formal definitions, provide examples, give mathematical justifications (usually complete proofs), and end with a set of exercises. Solutions to some of the exercises appear in the appendix.

> More than anything else, the book needs to provide readers with a broader framework that naturally motivates the many topics covered. Instructors looking for a general reference on automata and formal languages, or a textbook for a mathematically sophisticated audience, should take note that Linz’s book lacks a comprehensive bibliography (the one-page list of references consists primarily of other theory textbooks).

> Overall, the work is appropriate for the author’s stated purpose: a textbook for an introductory undergraduate course on the theory of computation—provided that the students have sufficient mathematical preparation.


---

