State complexity of code operators
type: Item
instance of: scholarly article
zbMATH Open document ID: 1252.68182
DOI: 10.1142/S0129054111008957
author: Elena Pribavkina
author: Emanuele Rodaro
published in: International Journal of Foundations of Computer Science
publication date: 2012-08-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 6073872
zbMATH Keywords: state complexity
zbMATH Keywords: regular language
zbMATH Keywords: code
MaRDI profile type: Publication
cites work: Intersection and union of regular languages and state complexity
cites work: State complexity of basic operations on suffix-free regular languages
cites work: Q3655366
cites work: On free monoids partially ordered by embedding
cites work: State complexity of some operations on binary regular languages
cites work: On NFAs where all states are final, initial, or both
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
cites work: Synchronizing automata with finitely many minimal synchronizing words
cites work: Synchronizing Automata and the Černý Conjecture
full work available at URL: s0129054111008957
OpenAlex ID: W1994062790
title: State complexity of code operators
description: scientific article; zbMATH DE number 6073872