• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

balodis · 2014-08-07T15:16:38Z

No description provided.

balodis added the mfcs_review label Aug 7, 2014

rihardsk mentioned this issue Aug 8, 2014

• page 7, line 8: Is it possible to decide for an arbitrary automaton whether the norm converges? #26

Closed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

balodis commented Aug 7, 2014

• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

Comments

balodis commented Aug 7, 2014