State complexity of some operations on binary regular languages
type: Item
instance of: scholarly article
title: State complexity of some operations on binary regular languages
zbMATH Open document ID: 1078.68088
author: Galina Jirásková
published in: Theoretical Computer Science
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2136576
zbMATH Keywords: State complexity
zbMATH Keywords: Regular language operations
zbMATH Keywords: Binary languages
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.04.011
OpenAlex ID: W2050154914
cites work: Q4139689
cites work: Intersection and union of regular languages and state complexity
cites work: Partial orders on words, minimal elements of regular languages, and state complexity
cites work: Q4474150
cites work: Q4807824
cites work: Q4465331
cites work: A lower bound technique for the size of nondeterministic finite automata
cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
cites work: Q4412108
cites work: Q4418610
cites work: Q4531373
cites work: Q4337605
cites work: Q4465337
cites work: Communication complexity method for measuring nondeterminism in finite automata
cites work: Q4453205
cites work: Succinct representation of regular languages by Boolean automata
cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
cites work: Q4540972
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
cites work: Q5541339
cites work: Nondeterminism and the size of two way finite automata
cites work: Q3392273
cites work: The state complexities of some basic operations on regular languages
cites work: State complexity of regular languages
DOI: 10.1016/J.TCS.2004.04.011
description: scientific article; zbMATH DE number 2136576