Finite state automata and regular languages.

dc.contributor.author	Wu, Jun.
dc.date.accessioned	2012-07-09T22:20:09Z
dc.date.available	2012-07-09T22:20:09Z
dc.date.created	1992	en_US
dc.date.issued	2012-07-09
dc.identifier.uri	http://hdl.handle.net/123456789/1816
dc.description	56 leaves	en_US
dc.description.abstract	This thesis is intended for an audience familiar with basic formal language theory and finite state automata theory. Chapter 1 is the introduction to regular languages and the operations among them. Chapter 2 is the introduction to deterministic finite state automata and their computation. Chapter 3 is the introduction to nondeterministic finite state automata and shows the equivalence of deterministic finite state automata and nondeterministic finite state automata. Chapter 4 proves the famous Kleen's Theorem and builds up the relationship between regular languages and finite state automata. Chapter 5 discusses the minimization of deterministic finite state automata. Chapter 6 summarizes the thesis.	en_US
dc.language.iso	en_US	en_US
dc.subject	Programming languages (Electronic computers)	en_US
dc.title	Finite state automata and regular languages.	en_US
dc.type	Thesis	en_US
dc.college	las	en_US
dc.department	mathematics, computer science, and economics	en_US