State complexity of basic language operations combined with reversal
type: Item
instance of: scholarly article
title: State complexity of basic language operations combined with reversal
zbMATH Open document ID: 1154.68073
author: Guangwu Liu
author: Arto Salomaa
author: Carlos Martín-Vide
author: Sheng Yu
published in: Information and Computation
publication date: 2008-10-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5349806
zbMATH Keywords: finite state automata
zbMATH Keywords: regular languages
zbMATH Keywords: state complexity
zbMATH Keywords: combined operations
MaRDI profile type: Publication
full work available at URL: j.ic.2008.03.018
OpenAlex ID: W2066620717
cites work: Q4363531
cites work: Multiple-entry finite automata
cites work: Q3862379
cites work: Q4540955
cites work: Q3108337
cites work: Q5511413
cites work: State complexity of combined operations
cites work: On the state complexity of reversals of regular languages
cites work: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
cites work: Q4714446
cites work: Q4681320
cites work: State complexity of regular languages
cites work: The state complexities of some basic operations on regular languages
DOI: 10.1016/J.IC.2008.03.018
description: scientific article; zbMATH DE number 5349806