An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3938587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable |
scientific article; zbMATH DE number 3938587 |
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
0.8551601
0 references
0.83654237
0 references
0 references
0.8353688
0 references
0 references
0.82702523
0 references
0.82658863
0 references
