Name
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. |
Year | Venue | Keywords |
|---|---|---|
2003 | Journal of Automata, Languages and Combinatorics | different way,sharp bound,maximal length,finite automaton,input word,shortest di-directing word,synchronizing |
Field | DocType | Volume |
Discrete mathematics,Monotonic function,Combinatorics,Nondeterministic algorithm,Synchronizing,Automaton,Finite-state machine,Nondeterministic finite automaton with ε-moves,Mathematics,Nondeterministic automata | Journal | 8 |
Issue | Citations | PageRank |
3 | 2 | 0.53 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Imreh | 1 | 42 | 16.05 |
| Csanád Imreh | 2 | 103 | 13.18 |
| Masami Ito | 3 | 299 | 66.19 |