On some decidability problems for HDOL systems with nonsingular Parikh matrices

DOI10.1016/0304-3975(79)90037-9zbMath0414.68044OpenAlexW1973991503MaRDI QIDQ599513

Keijo Ruohonen

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)90037-9

zbMATH Keywords

decidabilitydevelopmental systemsHdol systemsnonsingular Parikh matricesrational sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Equality sets of binary D0L sequences ⋮ EQUALITY SETS OF MORPHIC WORD SEQUENCES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generating function of the number of subpatterns of a DOL sequence
• Zeros of Z-rational functions and DOL equivalence
• The ultimate equivalence problem for DOL systems
• A note on recurring series
• Deux propriétés décidables des suites récurrentes linéaires
• The decidability of the equivalence problem for DOL-systems

This page was built for publication: On some decidability problems for HDOL systems with nonsingular Parikh matrices