scientific article; zbMATH DE number 3933047

MaRDI QIDQ3708002zbMATH OpenFDO

Authors Alexander Leitsch

Publication date 1984

zbMATH Keywords

complexityeffective enumerations of subrecursive classesindex setstranslation functions

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45) Specification and verification (program logics, model checking, etc.) (68Q60) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 3918355
• scientific article; zbMATH DE number 3948238
• scientific article; zbMATH DE number 3934415
• Reconnaissabilité des substitutions et complexité des suites automatiques
• On the asymptotic enumeration of accessible automata
• Enumeration and decidable properties of automatic sequences
• Enumeration and decidable properties of automatic sequences
• Decidability and Enumeration for Automatic Sequences: A Survey
• Iterated stack automata and complexity classes
• scientific article; zbMATH DE number 1484314

Cited in

(2)

• scientific article; zbMATH DE number 3918355 (Why is no real title available?)
• scientific article; zbMATH DE number 3948238 (Why is no real title available?)

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