Recognizability and \(m \times n\)-polypodic automata. I (Q4903877)
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: Recognizability and m n-polypodic automata. I |
scientific article; zbMATH DE number 6131356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizability and \(m \times n\)-polypodic automata. I |
scientific article; zbMATH DE number 6131356 |
Statements
28 January 2013
0 references
\(m \times n\)-polypode
0 references
polypodic and lower congruences
0 references
recognizable subset of an \(m \times n\)-polypode
0 references
\(m\times n\)-polypodic automaton
0 references
reducible equivalence
0 references
minimal \(m \times n\)-polypodic automaton
0 references
0.928918480873108
0 references
0.869053840637207
0 references
0.8438854813575745
0 references
0.7234231233596802
0 references
