Introduction to automata theory, languages, and computation

By: Contributor(s): Material type: TextTextSeries: (Addison-Wesley series in computer science / Michael A. Harrison, ed.)Publication details: Reading : , 1979Edition: 1a edISBN:
  • 020102988X
Subject(s):
Contents:
1- Preliminaries 2- Finite automata and regular expressions 3- Properties of regular sets 4- Context-free grammars 5- Pushdown automata 6- Properties of context-free languages 7- Turing machines 8- Undecidability 9- The Chomsky hierarchy 10- Deterministic context-free languages 11- Closure properties of families of languages 12- Computational complexity theory 13- Intractable problems 14- Highlights of other important language classes -- Bibliography (p. 396-410) -- Index.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Fotocopia Fotocopia Biblioteca Fac.Informática F.1.1 HOP (Browse shelf(Opens below)) Available DIF-F156

Copia anillada. --

1- Preliminaries 2- Finite automata and regular expressions 3- Properties of regular sets 4- Context-free grammars 5- Pushdown automata 6- Properties of context-free languages 7- Turing machines 8- Undecidability 9- The Chomsky hierarchy 10- Deterministic context-free languages 11- Closure properties of families of languages 12- Computational complexity theory 13- Intractable problems 14- Highlights of other important language classes -- Bibliography (p. 396-410) -- Index.

There are no comments on this title.

to post a comment.

Powered by Koha