: Comprehensive instruction on designing and testing Finite Automata (DFA, NFA), Pushdown Automata (PDA), and Linear Bounded Automata (LBA).
Frustrated, she shoved aside a stack of dusty hard drives and found her father’s old college trunk. He had been a theoretical computer scientist in the 90s, a man who loved proofs more than people. Inside, under brittle floppy disks, was a single printout: a faded cover page.
Context-Free Grammars (CFG) and Pushdown Automata (PDA). Context-Sensitive Languages: Linear Bounded Automata (LBA). Recursively Enumerable Languages: Turing Machines (TM).
Book details * ISBN-10. 9780198071068. * ISBN-13. 978-0198071068. * Edition. Illustrated. * Publisher. Oxford. * Publication date. Formal Languages and Automata Theory - Amazon.com
A course on the Relationship of Formal Language Theory to Automata