On some decidability problems for HDOL systems with nonsingular Parikh matrices

DOI10.1016/0304-3975(79)90037-9MaRDI QIDQ599513zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3519899 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3233758 (Why is no real title available?)
• 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
• The generating function of the number of subpatterns of a DOL sequence
• The ultimate equivalence problem for DOL systems
• Zeros of Z-rational functions and DOL equivalence

Cited in

(2)

• Equality sets of binary D0L sequences
• Equality sets of morphic word sequences

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

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