scientific article; zbMATH DE number 2040942

MaRDI QIDQ4452093zbMATH OpenFDO

Authors Klaus Ambos-Spies, Edgar Busse

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2731/27310097.htm

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15) Baire category, Baire spaces (54E52) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• Finite-state genericity. On the diagonalization strength of finite automata.
• Publication:4863237
• scientific article; zbMATH DE number 1502108
• scientific article; zbMATH DE number 3885884
• scientific article; zbMATH DE number 5158876

Cited in

(6)

• The method of forced enumeration for nondeterministic automata
• Finite state incompressible infinite sequences
• scientific article; zbMATH DE number 5158876
• scientific article; zbMATH DE number 841081 (Why is no real title available?)
• Finite-state genericity. On the diagonalization strength of finite automata.
• Entropy rates and finite-state dimension

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 Q4452093)