Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Deux propriétés décidables des suites récurrentes linéaires / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: What makes some language theory problems undecidable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4168964 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy events realized by finite probabilistic automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Theorem of R. Jungen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On stochastic languages / rank | |||
Normal rank |
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