Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048): Difference between revisions
From MaRDI portal
Latest revision as of 17:17, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression |
scientific article |
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