Automata and semigroups recognizing infinite words
From MaRDI portal
Publication:3086922
Recommendations
Cited in
(8)- scientific article; zbMATH DE number 7559499 (Why is no real title available?)
- scientific article; zbMATH DE number 7561335 (Why is no real title available?)
- scientific article; zbMATH DE number 988807 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- \(X\)-automata on \(\omega\)-words
- scientific article; zbMATH DE number 3976377 (Why is no real title available?)
- Synthesis of computable regular functions of infinite words
- Classifying recognizable infinitary trace languages using word automata
This page was built for publication: Automata and semigroups recognizing infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086922)