State complexity of inversion operations
type: Item
instance of: scholarly article
title: State complexity of inversion operations
zbMATH Open document ID: 1332.68110
author: Da-Jung Cho
author: Yo-Sub Han
author: Sang-Ki Ko
author: Kai Salomaa
published in: Theoretical Computer Science
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6519451
zbMATH Keywords: state complexity
zbMATH Keywords: inversion operations
zbMATH Keywords: finite automata
zbMATH Keywords: regular languages
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.04.017
OpenAlex ID: W2174018860
cites work: Intersection and union of regular languages and state complexity
cites work: Efficient string-matching allowing for non-overlapping inversions
cites work: Pseudo-inversion on Formal Languages
cites work: Closure and decidability properties of some language classes with respect to ciliate bio-operations.
cites work: Operations and language generating devices suggested by the genome evolution
cites work: Estimation of state complexity of combined operations
cites work: Q3505886
cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
cites work: Descriptional and computational complexity of finite automata -- a survey
cites work: On Decidability and Closure Properties of Language Classes with Respect to Bio-operations
cites work: Reversal of binary regular languages
cites work: Q4967154
cites work: Succinct representation of regular languages by Boolean automata
cites work: Q5628039
cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
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.2015.04.017
description: scientific article; zbMATH DE number 6519451