State complexity of power
type: Item
instance of: scholarly article
title: State complexity of power
zbMATH Open document ID: 1168.68024
author: Michael Domaratzki
author: Alexander Okhotin
published in: Theoretical Computer Science
publication date: 2009-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5561686
zbMATH Keywords: descriptional complexity
zbMATH Keywords: finite automata
zbMATH Keywords: state complexity
zbMATH Keywords: combined operations
zbMATH Keywords: concatenation
zbMATH Keywords: power
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.02.025
OpenAlex ID: W2084661883
cites work: Intersection and union of regular languages and state complexity
cites work: Q4465333
cites work: Q3505886
cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
cites work: On the state complexity of star of union and star of intersection
cites work: State complexity of basic language operations combined with reversal
cites work: Q5628039
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
cites work: The state complexity of \(L^{2}\) and \(L^k\)
cites work: Q4714446
cites work: State complexity of combined operations
cites work: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
cites work: The state complexities of some basic operations on regular languages
DOI: 10.1016/J.TCS.2009.02.025
description: scientific article; zbMATH DE number 5561686