دورية أكاديمية
A polynomial time algorithm for the local testability problem of deterministic finite automata
| العنوان: | A polynomial time algorithm for the local testability problem of deterministic finite automata |
|---|---|
| المؤلفون: | Kim, S.M., McNaughton, R., McCloskey, R. |
| المصدر: | IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. 40(10):1087-1093 Oct, 1991 |
| قاعدة البيانات: | IEEE Xplore Digital Library |
Full Text Finder | تدمد: | 00189340 15579956 23263814 |
|---|---|
| DOI: | 10.1109/12.93741 |