Hierarchies of aperiodic languages Revue française d ’ automatique informatique recherche opérationnelle
暂无分享,去创建一个
[1] Magnus steinby. On definite automata and related systems , 1969 .
[2] Imre Simon,et al. Piecewise testable events , 1975, Automata Theory and Formal Languages.
[3] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .
[4] Abraham Ginzburg,et al. About Some Properties of Definite, Reverse-Definite and Related Automata , 1966, IEEE Trans. Electron. Comput..
[5] Yechezkel Zalcstein,et al. Locally testable semigroups , 1972 .
[6] Janusz A. Brzozowski,et al. Dot-Depth of Star-Free Events , 1971, Journal of computer and system sciences (Print).
[7] Robert McNaughton,et al. Algebraic decision procedures for local testability , 1974, Mathematical systems theory.
[8] Yechezkel Zalcstein,et al. Locally Testable Languages , 1972, J. Comput. Syst. Sci..
[9] Janusz A. Brzozowski,et al. Characterizations of locally testable events , 1973, Discret. Math..
[10] S. Eilenberg. Automata, Languages and Machines, Vol. B , 1976 .
[11] Yechezkel Zalcstein. Syntactic Semigroups of Some Classes of Star-Free Languages , 1972, ICALP.
[12] Marcel Paul Schützenberger,et al. On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..
[13] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .