State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages

DOI10.1007/978-3-030-93489-7_6OpenAlexW4285555445MaRDI QIDQ2096584

Stefan Hoffmann

Publication date: 9 November 2022

Full work available at URL: https://arxiv.org/abs/2111.13524

zbMATH Keywords

shufflefinite automatastate complexitycommutative languagesstar-free languagesgroup languagesaperiodic languagesupward and downward closure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Commutative regular languages with product-form minimal automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of projection on languages recognized by permutation automata and commuting letters
• On the state complexity of closures and interiors of regular languages with subwords and superwords
• Effective constructions in well-partially-ordered free monoids
• Variétés de langages et opérations
• The state complexities of some basic operations on regular languages
• Commutative regular languages with product-form minimal automata
• Commutative regular languages -- properties and state complexity
• The size of Higman-Haines sets
• Characterizations of locally testable events
• The Shuffle Product: New Research Directions
• On the State Complexity of the Shuffle of Regular Languages
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Learning Commutative Regular Languages
• Software Descriptions with Flow Expressions
• An approach to software system behavior description
• On Shuffle Ideals
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• On the State Complexity of Scattered Substrings and Superstrings
• Operations on Permutation Automata
• On finite monoids having only trivial subgroups
• The loop complexity of pure-group events
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• More on the Size of Higman-Haines Sets: Effective Constructions

This page was built for publication: State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages