Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048)
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: Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression |
scientific article; zbMATH DE number 3784838
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression |
scientific article; zbMATH DE number 3784838 |
Statements
Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (English)
0 references
1982
0 references
recursiveness
0 references
integer-valued square matrix
0 references
exact algorithm
0 references
full matrix equivalence problem
0 references
equivalence problem modulo finite set
0 references
0 references
