A polynomial time algorithm for the local testability problem of deterministic finite automata (Q5375412)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time algorithm for the local testability problem of deterministic finite automata |
scientific article; zbMATH DE number 6937006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for the local testability problem of deterministic finite automata |
scientific article; zbMATH DE number 6937006 |
Statements
A polynomial time algorithm for the local testability problem of deterministic finite automata (English)
0 references
14 September 2018
0 references
