State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal-Reference-Cited by-同舟云学术

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal

Published:2011 Issue: Volume: Page:158-171
ISSN:0302-9743
Container-title:Descriptional Complexity of Formal Systems
language:
Short-container-title:

Author:

Gao Yuan,Yu Sheng

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22600-7_13

Reference26 articles.

1. Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of catenation combined with star and reversal. In: Proceedings of Descriptional Complexity of Formal Systems 12th Workshop, Saskatoon, pp. 74–85 (2010)

2. Lecture Notes in Computer Science;B. Cui,2011

3. Lecture Notes in Computer Science;C. Câmpeanu,2001

4. Campeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics 7(3), 303–310 (2002)

5. Daley, M., Domaratzki, M., Salomaa, K.: State complexity of orthogonal catenation. In: Proceedings of Descriptional Complexity of Formal Systems 10th Workshop, Charlottetown, pp. 134–144 (2008)

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

1. State Complexity of Pseudocatenation;Language and Automata Theory and Applications;2019

2. Undecidability of state complexity;International Journal of Computer Mathematics;2013-06

3. State complexity of union and intersection of square and reversal on k regular languages;Theoretical Computer Science;2012-10

4. State complexity of union and intersection of star on regular languages;Theoretical Computer Science;2012-04

5. State Complexity of Kleene-Star Operations on Trees;Computation, Physics and Beyond;2012