Some Decision Problems Concerning Semili
β
Tero Harju; Oscar Ibarra; Juhani KarhumΓ€ki; Arto Salomaa
π
Article
π
2002
π
Elsevier Science
π
English
β 189 KB
Let M be a class of automata (in a precise sense to be defined) and M c the class obtained by augmenting each automaton in M with finitely many reversal-bounded counters. We show that if the languages defined by M are effectively semilinear, then so are the languages defined by M c , and, hence, the