Bilimites de langages reconnaissables

DOI10.1016/0304-3975(84)90095-1zbMath0555.68044OpenAlexW1974936237MaRDI QIDQ760801

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)

Related Items (6)

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

Cites Work

• Unnamed Item

This page was built for publication: Bilimites de langages reconnaissables