Bilimites de langages reconnaissables (Q760801)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bilimites de langages reconnaissables |
scientific article; zbMATH DE number 3885332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bilimites de langages reconnaissables |
scientific article; zbMATH DE number 3885332 |
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
