STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL-Reference-Cited by-同舟云学术

STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL

Published:2012-01 Issue:01 Volume:23 Page:51-66
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CUI BO¹,GAO YUAN¹,KARI LILA¹,YU SHENG¹

Affiliation:

1. Department of Computer Science, The University of Western Ontario, London, Ontario, N6A 5B7, Canada

Abstract

This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state complexities of their individual participating operations.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054112400047

Reference14 articles.

1. State complexity of power

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

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

2. IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES;International Journal of Foundations of Computer Science;2013-09

3. State complexity of star of union and square of union on k regular languages;Theoretical Computer Science;2013-08

4. Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star;Descriptional Complexity of Formal Systems;2013

5. Universal Witnesses for State Complexity of Basic Operations Combined with Reversal;Implementation and Application of Automata;2013