State complexity of permutation and related decision problems on alphabetical pattern constraints
From MaRDI portal
Publication:2117669
DOI10.1007/978-3-030-79121-6_10OpenAlexW3175373088MaRDI QIDQ2117669
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2006.15178
finite automatastate complexityinclusion problemcommutative closurealphabetic pattern constraint language
Related Items (4)
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Unnamed Item ⋮ On Simon's congruence closure of a string ⋮ On Simon's congruence closure of a string
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages and partial commutations
- Permutation rewriting and algorithmic verification
- Languages of R-trivial monoids
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- The state complexities of some basic operations on regular languages
- Complexity of universality and related problems for partially ordered NFAs
- State complexity bounds for the commutative closure of group languages
- Generic results for concatenation hierarchies
- State complexity of permutation on finite languages over a binary alphabet
- Dot-depth of star-free events
- On the structure of semigroups
- Green’s Relations and Their Use in Automata Theory
- The Dot-Depth Hierarchy, 45 Years Later
- CONCUR 2004 - Concurrency Theory
- On finite monoids having only trivial subgroups
- The State Complexity of Permutations on Finite Languages over Binary Alphabets
- Synchronization problems in automata without non-trivial cycles
This page was built for publication: State complexity of permutation and related decision problems on alphabetical pattern constraints
