On regular languages determined by nondeterministic directable automata

Authors

  • Balázs Imreh
  • Masami Ito

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.

Downloads

Download data is not yet available.

Downloads

Published

2005-01-01

How to Cite

Imreh, B., & Ito, M. (2005). On regular languages determined by nondeterministic directable automata. Acta Cybernetica, 17(1), 1–10. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3650

Issue

Vol. 17 No. 1 (2005)

Section

Regular articles