"Complexity of the calculation of predicates by finite automata."

Yuri Breitbart (1973)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-12-01

- view
  - electronic edition @ exlibrisgroup.com
- export record
  dblp key:
  - phd/il/Breitbart73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/il/Breitbart73
Yuri Breitbart:
Complexity of the calculation of predicates by finite automata. Technion - Israel Institute of Technology, Israel, 1973

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.