We investigate the possibility of extending Chrobak normal form to the probabilistic case. While in the nondeterministic case a unary automaton can be simulated by an automaton in Chrobak normal form without increasing the number of the states in the cycles, we show that in the probabilistic case the simulation is not possible by keeping the same number of ergodic states. This negative result is proved by considering the natural extension to the probabilistic case of Chrobak normal form, obtained...
We investigate the possibility of extending Chrobak normal form to the probabilistic
case. While in the nondeterministic case a unary automaton can be simulated by an
automaton in Chrobak normal form without increasing the number of the states in the
cycles, we show that in the probabilistic case the simulation is not possible by keeping
the same number of ergodic states. This negative result is proved by considering the
natural extension to the...
We investigate the possibility of extending Chrobak normal form to the probabilistic
case. While in the nondeterministic case a unary automaton can be simulated by an
automaton in Chrobak normal form without increasing the number of the states in the
cycles, we show that in the probabilistic case the simulation is not possible by keeping
the same number of ergodic states. This negative result is proved by considering the
natural extension to the...
Let
= { ∈
| () } be the language recognized by a formal series :
→ ℝ with isolated cut point . We provide new conditions that guarantee the regularity of the language
in the case that is rational or is a Hadamard quotient of rational series. Moreover the decidability property of such conditions is investigated.
Let
= { ∈
| () } be the
language recognized by a formal series
:
→ ℝ with isolated cut point
. We provide new conditions that guarantee the regularity of the
language
in the case that
is rational or is a Hadamard quotient of rational
series. Moreover the decidability property of such conditions is investigated.
Let
= { ∈
| () } be the
language recognized by a formal series
:
→ ℝ with isolated cut point
. We provide new conditions that guarantee the regularity of the
language
in the case that
is rational or is a Hadamard quotient of rational
series. Moreover the decidability property of such conditions is investigated.
Download Results (CSV)