Name
Abstract | ||
|---|---|---|
It is known that the languages consisting of directing words of deterministic and nondeterministic automata are regular. Here these classes of regular languages are studied and compared. By introducing further three classes of regular languages, it is proved that the 8 classes considered form a semilattice with respect to intersection. |
Year | Venue | Keywords |
|---|---|---|
2005 | Acta Cybern. | nondeterministic automaton,nondeterministic directable automaton,regular language |
Field | DocType | Volume |
Generalized star height problem,Discrete mathematics,Combinatorics,Nondeterministic finite automaton,Formal language,Nested word,Deterministic finite automaton,Abstract family of languages,Cone (formal languages),Pumping lemma for regular languages,Mathematics | Journal | 17 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Imreh | 1 | 42 | 16.05 |
| Masami Ito | 2 | 299 | 66.19 |