The generating function of the number of subpatterns of a DOL sequence

DOI10.1016/0304-3975(79)90056-2MaRDI QIDQ1132640zbMATH OpenOpenAlexFDO

Authors Peter Johansen

Publication date 1979

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(79)90056-2

zbMATH Keywords

decision problemsgenerating function for the number of subpatterns of a Dol sequenceMagnus transform for power series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cites work

• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)
• Integral sequential word functions and growth equivalence of lindenmayer systems

Cited in

(7)

• A modified iterative proportional scaling algorithm for estimation in regular exponential families
• On the interpolation of DOL-sequences
• Towards a General Concept of Hypercodes
• Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
• On some decidability problems for HDOL systems with nonsingular Parikh matrices
• Sur les séries associees à certains systèmes de Lindenmayer
• Domains of attraction to Tweedie distributions

This page was built for publication: The generating function of the number of subpatterns of a DOL sequence

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