Subword complexities of various classes of deterministic developmental languages with interactions

DOI10.1007/BF01007760MaRDI QIDQ4066603zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01007760

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• A limit theorem for set of subwords in deterministic TOL laguages
• A note on some systems of lindenmayer
• Development systems with locally catenative formulas
• DOL sequences
• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3550202 (Why is no real title available?)
• scientific article; zbMATH DE number 3438418 (Why is no real title available?)
• scientific article; zbMATH DE number 3383530 (Why is no real title available?)
• scientific article; zbMATH DE number 3421926 (Why is no real title available?)
• Integral sequential word functions and growth equivalence of lindenmayer systems

This page was built for publication: Subword complexities of various classes of deterministic developmental languages with interactions

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