Commutative regular languages with product-form minimal automata

DOI10.1007/978-3-030-93489-7_5OpenAlexW3217515455MaRDI QIDQ2096583

Stefan Hoffmann

Publication date: 9 November 2022

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

zbMATH Keywords

shufflefinite automatonstate complexitypartial commutationcommutative languagedownward closureproduct-form minimal automatonupward closure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

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

Cites Work

• Regular languages and partial commutations
• On a structural property in the state complexity of projected regular languages
• On regularity of context-free languages
• 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
• The state complexities of some basic operations on regular languages
• State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
• Commutative regular languages -- properties and state complexity
• The size of Higman-Haines sets
• Characterizations of locally testable events
• On the State Complexity of the Shuffle of Regular Languages
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Learning Commutative Regular Languages
• Inferring Regular Trace Languages from Positive and Negative Samples
• Software Descriptions with Flow Expressions
• On Shuffle Ideals
• On the State Complexity of Scattered Substrings and Superstrings
• More on the Size of Higman-Haines Sets: Effective Constructions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Commutative regular languages with product-form minimal automata