The affine hull of a binary automaton is computable in polynomial time (Q2847416)
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: The affine hull of a binary automaton is computable in polynomial time |
scientific article; zbMATH DE number 6207130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The affine hull of a binary automaton is computable in polynomial time |
scientific article; zbMATH DE number 6207130 |
Statements
9 September 2013
0 references
The affine hull of a binary automaton is computable in polynomial time (English)
0 references
