State complexity of projection on languages recognized by permutation automata and commuting letters

DOI10.1007/978-3-030-81508-0_16OpenAlexW3198271433MaRDI QIDQ832938

Stefan Hoffmann

Publication date: 25 March 2022

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

zbMATH Keywords

projectionfinite automatastate complexitycommutative automatapermutation automatastate-partition automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Nondeterministic operational complexity in subregular languages ⋮ 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

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a structural property in the state complexity of projected regular languages
• The mathematical writings of Évariste Galois
• The state complexities of some basic operations on regular languages
• Supervisory control of discrete-event systems
• Supervisory control synthesis of discrete-event systems using a coordination scheme
• On Properties and State Complexity of Deterministic State-Partition Automata
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• Introduction to Discrete Event Systems
• Operations on Permutation Automata
• Coordination Control of Distributed Discrete-Event Systems
• Permutation automata
• The loop complexity of pure-group events
• Finite-State Techniques
• Complexity of proper prefix-convex regular languages

This page was built for publication: State complexity of projection on languages recognized by permutation automata and commuting letters