"Computational Complexity of Certain Problems Related to Carefully ..."

Pavel Martyugin (2014)

> Home

Details and statistics

DOI: 10.1007/S00224-013-9516-6

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Martyugin14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Martyugin14
Pavel Martyugin:
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata. Theory Comput. Syst. 54(2): 293-304 (2014)

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.