Bilimites de langages reconnaissables

DOI10.1016/0304-3975(84)90095-1zbMATH Open0555.68044OpenAlexW1974936237MaRDI QIDQ760801FDOQ760801

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

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)

zbMATH Keywords

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)

Cited In (8)

• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Automata on linear orderings
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Logic, semigroups and automata on words
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complementation of rational sets on scattered linear orderings of finite rank

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)