Bilimites de langages reconnaissables

DOI10.1016/0304-3975(84)90095-1MaRDI QIDQ760801zbMATH OpenOpenAlexFDO

Authors Danièle Girault-Beauquier

Publication date 1984

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(84)90095-1

zbMATH Keywords

bilimits of finitary rational languagesrational languages of two-sided infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 3992940
• scientific article; zbMATH DE number 3947646
• Finitely generated bi\(\omega\)-languages
• scientific article; zbMATH DE number 176496
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)

Cited in

(9)

• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Logic, semigroups and automata on words
• Complementation of rational sets on scattered linear orderings of finite rank
• scientific article; zbMATH DE number 3860417 (Why is no real title available?)
• scientific article; zbMATH DE number 940749 (Why is no real title available?)
• scientific article; zbMATH DE number 3992940 (Why is no real title available?)
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• Automata on linear orderings

This page was built for publication: Bilimites de langages reconnaissables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760801)