论文信息 - Open Problems Column - 字舞流文

Open Problems Column

William I. Gasarch | W. Gasarch

[1] Paul M. B. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications, Third Edition , 1997, Texts in Computer Science.

[2] Jeffrey Shallit,et al. A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[3] Ming Li,et al. A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version) , 1989, ICALP.

[4] Jean-Camille Birget,et al. Intersection and Union of Regular Languages and State Complexity , 1992, Inf. Process. Lett..

[5] Wolfgang Thomas. An application of the Ehrenfeucht-Fraisse game in formal language theory , 1984 .

[6] G. Rozenberg,et al. Pumping Lemmas for Regular Sets , 1981, SIAM J. Comput..

[7] Richard E. Ladner,et al. Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata , 1977, Inf. Control..

[8] J. Büchi. Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[9] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.