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

DOI10.1016/0304-3975(79)90056-2zbMath0419.68098OpenAlexW2084432985MaRDI QIDQ1132640

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)

Related Items

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

Cites Work

• Integral sequential word functions and growth equivalence of lindenmayer systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item