State complexity of basic operations on suffix-free regular languages
type: Item
instance of: scholarly article
title: State complexity of basic operations on suffix-free regular languages
zbMATH Open document ID: 1172.68033
author: Yo-Sub Han
author: Kai Salomaa
published in: Theoretical Computer Science
publication date: 2009-07-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5577367
zbMATH Keywords: state complexity
zbMATH Keywords: suffix-free regular languages
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.054
OpenAlex ID: W2109036808
cites work: Q4430300
cites work: A Survey of Regular Expressions and Their Applications
cites work: Q4474150
cites work: Q4807824
cites work: Q4465331
cites work: Q5313787
cites work: STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
cites work: THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
cites work: Q4412108
cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
cites work: Q3862379
cites work: Implementation and Application of Automata
cites work: Q4284228
cites work: Succinct representation of regular languages by Boolean automata
cites work: Q4941905
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
cites work: On the state complexity of reversals of regular languages
cites work: Q4692941
cites work: Q4714446
cites work: State complexity of regular languages
cites work: The state complexities of some basic operations on regular languages
DOI: 10.1016/J.TCS.2008.12.054
description: scientific article; zbMATH DE number 5577367