"An upper bound for transforming self-verifying automata into deterministic ..."

Ira Assent, Sebastian Seibert (2007)

> Home

Details and statistics

DOI: 10.1051/ITA:2007017

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/AssentS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/AssentS07
Ira Assent, Sebastian Seibert:
An upper bound for transforming self-verifying automata into deterministic ones. RAIRO Theor. Informatics Appl. 41(3): 261-265 (2007)

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.