STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET-Reference-Cited by-同舟云学术

STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET

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

Author:

KRAWETZ BRYAN¹,LAWRENCE JOHN²,SHALLIT JEFFREY¹

Affiliation:

1. School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canada

2. Department of Pure Mathematics, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canada

Abstract

In this paper we consider the state complexity of an operation on formal languages, root(L). This naturally entails the discussion of the monoid of transformations of a finite set. We obtain good upper and lower bounds on the state complexity of root(L) over alphabets of all sizes. As well, we present an application of these results to the problem of 2DFA-DFA conversion.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

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

Reference17 articles.

1. State-complexity of finite-state devices, state compressibility and incompressibility

2. J. Dénes, Theory of Graphs: Proc. Colloq. Graph Theory (1966) (Academic Press, 1968) pp. 65–75.

3. J. Dénes, Permutations: Actes du Colloque sur Les Permutations, (1972) (Gauthier-Villars, 1972) pp. 117–120.

4. M. Holzer and B. König, Proc. DLT 2002, LNCS 2450 (Springer-Verlag, 2003) pp. 258–269.

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

1. Kleene Theorems for Lasso Languages and $$\omega $$-Languages;Lecture Notes in Computer Science;2024

2. The Exact State Complexity for the Composition of Root and Reversal;Developments in Language Theory;2023

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

4. Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata;Fundamenta Informaticae;2020-09-28

5. On Syntactic Complexity of Circular Semi-flower Automata;Implementation and Application of Automata;2018