State complexity of projection on languages recognized by permutation automata and commuting letters
From MaRDI portal
Publication:832938
DOI10.1007/978-3-030-81508-0_16OpenAlexW3198271433MaRDI QIDQ832938FDOQ832938
Authors: Stefan Hoffmann 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2108.06976
Recommendations
- State complexity of projected languages
- On properties and state complexity of deterministic state-partition automata
- On a structural property in the state complexity of projected regular languages
- Operations on Permutation Automata
- On the accepting state complexity of operations on permutation automata
projectionfinite automatastate complexitycommutative automatapermutation automatastate-partition automata
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- Title not available (Why is that?)
- The mathematical writings of Évariste Galois
- Introduction to Discrete Event Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coordination control of distributed discrete-event systems
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- On a structural property in the state complexity of projected regular languages
- Finite-state techniques. Automata, transducers and bimachines
- On properties and state complexity of deterministic state-partition automata
- Permutation automata
- The loop complexity of pure-group events
- Supervisory control of discrete-event systems
- Title not available (Why is that?)
- Languages recognized by finite supersoluble groups
- A survey on operational state complexity
- Operations on Permutation Automata
- Complexity of proper prefix-convex regular languages
Cited In (7)
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Nondeterministic operational complexity in subregular languages
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- Commutative regular languages with product-form minimal automata
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Uses Software
This page was built for publication: State complexity of projection on languages recognized by permutation automata and commuting letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832938)
