论文信息 - Intersection and Union of Regular Languages and State Complexity - 字舞流文

Intersection and Union of Regular Languages and State Complexity

Jean-Camille Birget | J. Birget

[1] B. Ravikumar,et al. Some applications of a technique of Sakoda and Sipser , 1990, SIGA.

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] Ernst L. Leiss. Some comments on a recent note by Ravikumar , 1991, SIGA.

[4] Jean-Camille Birget,et al. Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[5] Ernst L. Leiss,et al. Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[6] Sheng Yu,et al. On the state complexity of intersection of regular languages , 1991, SIGA.