State complexity of power-Reference-Cited by-同舟云学术

State complexity of power

Published:2009-05 Issue:24-25 Volume:410 Page:2377-2392
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Domaratzki Michael,Okhotin Alexander

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Intersection and union of regular languages and state complexity;Birget;Information Processing Letters,1992

2. On the number of distinct languages accepted by finite automata with n states;Domaratzki;Journal of Automata, Languages and Combinatorics,2002

3. K. Ellul, Descriptional complexity measures of regular languages, Master’s Thesis, University of Waterloo, Canada, 2002

4. Z. Ésik, Y. Gao, G. Liu, S. Yu, Estimation of state complexity of combined operations, in: C. Cămpeanu, G. Pighizzini (Eds.), 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, PEI, Canada, July 16–18, 2008, pp. 168–181

5. The state complexity of two combined operations: Star of catenation and star of reversal;Gao;Fundamenta Informaticae,2008

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

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

2. Operations on Subregular Languages and Nondeterministic State Complexity;Descriptional Complexity of Formal Systems;2022

3. A Study of a Simple Class of Modifiers: Product Modifiers;Developments in Language Theory;2020

4. State complexity of unambiguous operations on finite automata;Theoretical Computer Science;2019-12

5. Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem;Electronic Proceedings in Theoretical Computer Science;2019-09-18