On the problem whether the image of an N-rational series equals N

zbMATH Open1157.68383MaRDI QIDQ3409983FDOQ3409983

Juha Honkala

Publication date: 21 November 2006

Mathematics Subject Classification ID

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

Cited In (6)

• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Where Automatic Structures Benefit from Weighted Automata
• The isomorphism problem on classes of automatic structures with transitive relations
• On images of D0L and DT0L power series.
• Title not available (Why is that?)
• Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings

   Recommendations

• Rational series with high image complexity 👍 👎
• The cyclicity problem for the images of \(q\)-rational series 👍 👎
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base 👍 👎
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE 👍 👎
• Rational relations and rational series 👍 👎

This page was built for publication: On the problem whether the image of an \(N\)-rational series equals \(N\)

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