Rational series with high image complexity

DOI10.1051/ITA/2017001MaRDI QIDQ5354433zbMATH OpenOpenAlexFDO

Authors Juha Honkala

Publication date 4 September 2017

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2017001

zbMATH Keywords

Diophantine representationrational seriesrecursively enumerable setundecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Recursively (computably) enumerable sets and degrees (03D25) Decidability (number-theoretic aspects) (11U05) Formal languages and automata (68Q45)

Recommendations

• On the problem whether the image of an N-rational series equals N
• Rational relations and rational series
• scientific article; zbMATH DE number 4112574
• scientific article; zbMATH DE number 3915644
• scientific article; zbMATH DE number 1418476

Cited in

(3)

• Quasi-universal \(k\)-regular sequences
• On the problem whether the image of an N-rational series equals N
• scientific article; zbMATH DE number 1418476 (Why is no real title available?)

This page was built for publication: Rational series with high image complexity

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