Deterministic Generalized Automata

@article{Giammarresi1999DeterministicGA,
  title={Deterministic Generalized Automata},
  author={Dora Giammarresi and Rosa Montalbano},
  journal={Theor. Comput. Sci.},
  year={1999},
  volume={215},
  pages={191-208}
}
A generalized automaton (GA) is a nite automaton where the single transitions are deened on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable. We deene the model of deterministic generalized automaton (DGA) and study the problem of its minimization. A DGA has the restriction that, for each state, the sets of words corresponding to the transitions of that state are preex sets… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

The structure and complexity of minimal NFA ' s over aunary alphabet , Tech

  • E. McDowell Tao Jang, B. Ravikumar
  • Lecture Notes in Computer Science
  • 1995

Similar Papers

Loading similar papers…