On some decidability problems for HDOL systems with nonsingular Parikh matrices

DOI10.1016/0304-3975(79)90037-9zbMATH Open0414.68044OpenAlexW1973991503MaRDI QIDQ599513FDOQ599513

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

• Title not available (Why is that?)
• A note on recurring series
• Title not available (Why is that?)
• The generating function of the number of subpatterns of a DOL sequence
• Deux propriétés décidables des suites récurrentes linéaires
• The decidability of the equivalence problem for DOL-systems
• Zeros of Z-rational functions and DOL equivalence
• The ultimate equivalence problem for DOL systems
• Title not available (Why is that?)

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)