State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
type: Item
instance of: scholarly article
title: State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
DOI: 10.1007/978-3-030-93489-7_6
author: Stefan Hoffmann
publication date: 2022-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.13524
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614742
zbMATH Keywords: finite automata
zbMATH Keywords: state complexity
zbMATH Keywords: shuffle
zbMATH Keywords: upward and downward closure
zbMATH Keywords: commutative languages
zbMATH Keywords: group languages
zbMATH Keywords: aperiodic languages
zbMATH Keywords: star-free languages
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4285555445
cites work: On the State Complexity of the Shuffle of Regular Languages
cites work: QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
cites work: Characterizations of locally testable events
cites work: Q4048566
cites work: Q4807824
cites work: On the shuffle of star-free languages
cites work: Q4590910
cites work: Learning Commutative Regular Languages
cites work: The size of Higman-Haines sets
cites work: More on the Size of Higman-Haines Sets: Effective Constructions
cites work: On free monoids partially ordered by embedding
cites work: On Shuffle Ideals
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Commutative regular languages -- properties and state complexity
cites work: Commutative regular languages with product-form minimal automata
cites work: State complexity of projection on languages recognized by permutation automata and commuting letters
cites work: Operations on Permutation Automata
cites work: On the state complexity of closures and interiors of regular languages with subwords and superwords
cites work: Effective constructions in well-partially-ordered free monoids
cites work: Q5628039
cites work: Q4094357
cites work: The loop complexity of pure-group events
cites work: On the State Complexity of Scattered Substrings and Superstrings
cites work: Variétés de langages et opérations
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
cites work: The Shuffle Product: New Research Directions
cites work: An approach to software system behavior description
cites work: On finite monoids having only trivial subgroups
cites work: Software Descriptions with Flow Expressions
cites work: The state complexities of some basic operations on regular languages
description: scientific article; zbMATH DE number 7614742