"The Length of Subset Reachability in Nondeterministic Automata."

Pavel Martyugin (2008)

> Home

Details and statistics

DOI: 10.1016/J.ENTCS.2008.12.039

access: open

type: Conference or Workshop Paper

metadata version: 2023-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entcs/Martyugin08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/Martyugin08
Pavel Martyugin:
The Length of Subset Reachability in Nondeterministic Automata. RP 2008: 187-200

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.