Characterizations of Some Classes of Regular Events

Abstract We study two special classes of regular events: the piecewise testable events and the events of dot-depth one. Several characterizations of these events are given, especially in terms of their minimal automaton.

[1]  Robert Knast.  Some Theorems on Graph Congruences , 1983, RAIRO Theor. Informatics Appl..

[2]  Robert Knast,et al.  A Semigroup Characterization of Dot-Depth one Languages , 1983, RAIRO Theor. Informatics Appl..

[3]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[4]  Imre Simon,et al.  Piecewise testable events , 1975, Automata Theory and Formal Languages.

[5]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[6]  Janusz A. Brzozowski,et al.  Dot-Depth of Star-Free Events , 1971, Journal of computer and system sciences (Print).

[7]  Janusz A. Brzozowski,et al.  Hierarchies of Aperiodic Languages , 1976, RAIRO Theor. Informatics Appl..