Pages that link to "Item:Q5041254"
From MaRDI portal
The following pages link to Operations on Permutation Automata (Q5041254):
Displaying 12 items.
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Operations on Self-Verifying Finite Automata (Q3194721) (← links)
- (Q4955261) (← links)
- Applications of the finite state automata for counting restricted permutations and variations (Q5259332) (← links)
- Permutation automata (Q5539753) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- On the accepting state complexity of operations on permutation automata (Q6186540) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
- Decision problems for reversible and permutation automata (Q6666806) (← links)