Commutative regular languages with product-form minimal automata
type: Item
instance of: scholarly article
title: Commutative regular languages with product-form minimal automata
DOI: 10.1007/978-3-030-93489-7_5
author: Stefan Hoffmann
publication date: 2022-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.13523
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614741
zbMATH Keywords: finite automaton
zbMATH Keywords: state complexity
zbMATH Keywords: shuffle
zbMATH Keywords: upward closure
zbMATH Keywords: downward closure
zbMATH Keywords: commutative language
zbMATH Keywords: product-form minimal automaton
zbMATH Keywords: partial commutation
MaRDI profile type: Publication
OpenAlex ID: W3217515455
cites work: On the State Complexity of the Shuffle of Regular Languages
cites work: Characterizations of locally testable events
cites work: Q4048566
cites work: Q4807824
cites work: On regularity of context-free languages
cites work: Q4590910
cites work: Learning Commutative Regular Languages
cites work: Inferring Regular Trace Languages from Positive and Negative Samples
cites work: Regular languages and partial commutations
cites work: The size of Higman-Haines sets
cites work: More on the Size of Higman-Haines Sets: Effective Constructions
cites work: On Shuffle Ideals
cites work: Commutative regular languages -- properties and state complexity
cites work: State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
cites work: State complexity of projection on languages recognized by permutation automata and commuting letters
cites work: On a structural property in the state complexity of projected regular languages
cites work: On the state complexity of closures and interiors of regular languages with subwords and superwords
cites work: Q5628039
cites work: Q4094357
cites work: On the State Complexity of Scattered Substrings and Superstrings
cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
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 7614741