On monotonic directable nondeterministic automata

  • Authors:

  • Balázs Imreh;Csanád Imreh;Masami Ito

  • Affiliations:

  • Department of Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary;Department of Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary;Department of Mathematics, Faculty of Science, Kyoto Sangyo University, Kyoto 603-8555, Japan

  • Venue:
  • Journal of Automata, Languages and Combinatorics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A finite automaton is called directable if it has an input word which takes it from every state into the same state. Directability of nondeterministic (n. d.) automata can be defined in different ways. In [7], three notions of directability, D1-, D2-, and D3- directability, are introduced. Here, for each i = 1, 2, 3, we present sharp bounds for the maximal lengths of the shortest Di-directing words of n-state monotonic Di-directable n.d. automata.