"Closure algorithms and the star-height problem of regular languages."

Roland Carl Backhouse (1976)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-04-05

- view
  - electronic edition @ bl.uk
- export record
  dblp key:
  - phd/ethos/Backhouse76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ethos/Backhouse76
Roland Carl Backhouse:
Closure algorithms and the star-height problem of regular languages. Imperial College London, UK, 1976

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.