Pages that link to "Item:Q4913771"
From MaRDI portal
The following pages link to On the Complexity of Equivalence and Minimisation for Q-weighted Automata (Q4913771):
Displaying 15 items.
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- Inequality of finite behaviors of rational weight finite automata is in R (Q1014411) (← links)
- Complexity of regular functions (Q2424670) (← links)
- Quasi-weak cost automata: a new variant of weakness (Q2911613) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- Stochastization of Weighted Automata (Q2946327) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- (Q5089308) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Integer Weighted Automata on Infinite Words (Q6169963) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
- Orbit-finite-dimensional vector spaces and weighted register automata (Q6566474) (← links)
- Identity testing for radical expressions (Q6649437) (← links)
