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

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

> Home

Details and statistics

DOI: 10.1109/12.93741

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  authority control:
- export record
  dblp key:
  - journals/tc/KimMM91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/KimMM91
Sam M. Kim, Robert McNaughton, Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. IEEE Trans. Computers 40(10): 1087-1093 (1991)

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.