An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90059-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964508684 / rank | |||
Normal rank |
Revision as of 02:27, 20 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