State Complexity of Regular Languages: Finite versus Infinite-Reference-Cited by-同舟云学术

State Complexity of Regular Languages: Finite versus Infinite

Published:2000 Issue: Volume: Page:53-73
ISSN:
Container-title:Finite Versus Infinite
language:
Short-container-title:

Author:

Câmpeanu Cezar,Salomaa Kai,Yu Sheng

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-4471-0751-4_5.pdf

Reference19 articles.

1. C. Câmpeanu, K. Culik II, K. Salomaa, S. Yu, State complexity of basic operations on finite languages, Proc. Fourth International Workshop on Implementing Automata, WIA’99, to appear.

2. C. Câmpeanu, K. Culik II, S. Yu, Finite languages and cover automata, in preparation.

3. C. Câmpeanu, N. Sântean, S. Yu, Minimal cover automata for finite languages, Proc. Third International Workshop on Implementing Automata, WIA’98, Lecture Notes in Computer Science, 1660, Springer-Verlag, Berlin, 1999, 33–42.

4. A. K. Chandra, D. C. Kozen, L. J. Stockmeyer, Alternation, Journal of the ACM, 28 (1981), 114–133.

5. A. Fellah, H. Jürgensen, S. Yu, Constructions for alternating finite automata, Intern. J. Computer Math., 35 (1990) 117–132.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES;International Journal of Foundations of Computer Science;2010-08

2. ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION;International Journal of Foundations of Computer Science;2007-08

3. The Average State Complexity of the Star of a Finite Set of Words Is Linear;Developments in Language Theory