scientific article; zbMATH DE number 3933047

zbMATH Open0583.03024MaRDI QIDQ3708002FDOQ3708002

Authors: Alexander Leitsch 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexityindex setstranslation functionseffective enumerations of subrecursive classes

Mathematics Subject Classification ID

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

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)