Bilimites de langages reconnaissables (Q760801): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(84)90095-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974936237 / rank | |||
Normal rank | |||
Latest revision as of 19:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bilimites de langages reconnaissables |
scientific article |
Statements
Bilimites de langages reconnaissables (English)
0 references
1984
0 references
Every infinitary deterministic rational language is the limit of a finitary rational one and conversely. This standard result extends to languages of two-sided infinite words. So, the family of deterministic rational languages of two-sided infinite words is equal to the one of bilimits of finitary rational languages.
0 references
rational languages of two-sided infinite words
0 references
bilimits of finitary rational languages
0 references
