STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION-Reference-Cited by-同舟云学术

STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION

Published:2005-06 Issue:03 Volume:16 Page:511-529
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

JIRÁSEK JOZEF¹,JIRÁSKOVÁ GALINA²,SZABARI ALEXANDER³

Affiliation:

1. Institute of Computer Science, P.J. Šafárik University, Jesenná 5, 040 01 Košice, Slovakia

2. Mathematical Institute, Slovak Academy of Sciences, Grešákova 6, 040 01 Košice, Slovakia

3. Institute of Computer Science, P. J. Šafárik University, Jesenná 5, 040 01 Košice, Slovakia

Abstract

We investigate the state complexity of concatenation and the nondeterministic state complexity of complementation of regular languages. We show that the upper bounds on the state complexity of concatenation are also tight in the case that the first automaton has more than one accepting state. In the case of nondeterministic state complexity of complementation, we show that the entire range of complexities, up to the known upper bound can be produced.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

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

Reference28 articles.

1. Intersection and union of regular languages and state complexity

2. Partial orders on words, minimal elements of regular languages, and state complexity

3. C. Câmpeanu, Proc. 4th International Workshop on Implementing Automata (WIA '99), LNCS 2214, eds. O. Boldt and H. Jürgensen (Springer-Verlag, Heidelberg, 2001) pp. 60–70.

4. Finite automata and unary languages

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

1. Quantitatively nonblocking supervisory control of discrete-event systems;Automatica;2024-12

2. State Complexity of the Star of a Boolean Operation;2024

3. Nondeterministic operational complexity in subregular languages;Theoretical Computer Science;2023-09

4. Operational State Complexity Revisited: The Contribution of Monsters and Modifiers;Descriptional Complexity of Formal Systems;2023

5. Combination of roots and boolean operations: An application to state complexity;Information and Computation;2022-11