Autonomous automata and t(n)-generic language

MaRDI QIDQ3440892zbMATH OpenFDO

Authors V. I. Donskoy

Publication date 29 May 2007

zbMATH Keywords

characteristic functionautomatageneric language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1759420
• Finite-state genericity. On the diagonalization strength of finite automata.
• scientific article; zbMATH DE number 2040942
• Randomness of formal languages via automatic martingales
• Automaticity. III: Polynomial automaticity and context-free languages

Cited in

(5)

• scientific article; zbMATH DE number 5155118 (Why is no real title available?)
• scientific article; zbMATH DE number 2040942 (Why is no real title available?)
• Automata generated p-languages
• scientific article; zbMATH DE number 3930367 (Why is no real title available?)
• A description of \(\operatorname{Aut} (d V_n)\) and \(\operatorname{Out} (d V_n)\) using transducers

This page was built for publication: Autonomous automata and \(t(n)\)-generic language

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