"A Polynomial Time Algorithm for the Local Testability Problem of ..."

Sam M. Kim, Robert McNaughton, Robert McCloskey (1989)

> Home

Details and statistics

DOI: 10.1007/3-540-51542-9_35

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wads/KimMM89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/KimMM89
Sam M. Kim, Robert McNaughton, Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. WADS 1989: 420-436

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.