"Formal languages, automata, and complexity - theory of computation."

J. Glenn Brookshear (1989)

> Home

Details and statistics

DOI: —

access: unavailable

type: Book or Thesis

metadata version: 2011-05-05

- no documents available
- export record
  dblp key:
  - books/daglib/0067905
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/daglib/0067905
J. Glenn Brookshear:
Formal languages, automata, and complexity - theory of computation. notThenot Benjamin/Cummings series in computer science, Benjamin/Cummings 1989, ISBN 978-0-8053-0143-4, pp. I-XII, 1-322

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.