scientific article; zbMATH DE number 1502108

zbMATH Open0965.68040MaRDI QIDQ4503149FDOQ4503149

Authors: Jeffrey Shallit 

Publication date: 4 September 2000

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

Recommendations

• Automaticity. I: Properties of a measure of descriptional complexity
• Automaticity. III: Polynomial automaticity and context-free languages
• Automaticity. II: Descriptional complexity in the unary case

zbMATH Keywords

regular languagesautomaticity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Title not available (Why is that?)
• Cognitive and sub-regular complexity
• Perfect linear complexity profile and apwenian sequences
• On automatic families
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• 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 Q4503149)