An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3859267 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5557748 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5515450 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rational sets in commutative monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded Regular Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4155837 / rank | |||
Normal rank |
Latest revision as of 12:52, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable |
scientific article |
Statements
An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (English)
0 references
1985
0 references
free monoids
0 references
formal power series
0 references
unambiguous rational expression
0 references