Commutative regular languages with product-form minimal automata
From MaRDI portal
Publication:2096583
DOI10.1007/978-3-030-93489-7_5OpenAlexW3217515455MaRDI QIDQ2096583FDOQ2096583
Authors: Stefan Hoffmann 
Publication date: 9 November 2022
Full work available at URL: https://arxiv.org/abs/2111.13523
Recommendations
- Commutative regular languages -- properties and state complexity
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
- On the State Complexity of the Shuffle of Regular Languages
- scientific article; zbMATH DE number 1222104
- State complexity bounds for the commutative closure of group languages
shufflefinite automatonpartial commutationstate complexitycommutative languagedownward closureproduct-form minimal automatonupward closure
Cites Work
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Characterizations of locally testable events
- Software Descriptions with Flow Expressions
- Title not available (Why is that?)
- Commutative regular languages -- properties and state complexity
- Learning Commutative Regular Languages
- Regular languages and partial commutations
- Title not available (Why is that?)
- The size of Higman-Haines sets
- On the state complexity of scattered substrings and superstrings
- More on the Size of Higman-Haines Sets: Effective Constructions
- On a structural property in the state complexity of projected regular languages
- On regularity of context-free languages
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Title not available (Why is that?)
- On the State Complexity of the Shuffle of Regular Languages
- A survey on operational state complexity
- State complexity of projection on languages recognized by permutation automata and commuting letters
- On Shuffle Ideals
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
- Inferring regular trace languages from positive and negative samples
- Title not available (Why is that?)
Cited In (3)
- State complexity bounds for the commutative closure of group languages
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
This page was built for publication: Commutative regular languages with product-form minimal automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096583)
