scientific article; zbMATH DE number 3917744

MaRDI QIDQ3692897zbMATH OpenFDO

Authors Danièle Beauquier

Publication date 1985

zbMATH Keywords

deterministic Muller automatonregular sets of bi-infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Ensembles Reconnaissables de Mots Biinfinis
• scientific article; zbMATH DE number 3947646
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 3992940
• scientific article; zbMATH DE number 988807

Cited in

(6)

• Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
• scientific article; zbMATH DE number 3947646 (Why is no real title available?)
• Ensembles Reconnaissables de Mots Biinfinis
• scientific article; zbMATH DE number 3992940 (Why is no real title available?)
• scientific article; zbMATH DE number 222345 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003

This page was built for publication:

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