An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:05, 5 March 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
