Pages that link to "Item:Q1099641"
From MaRDI portal
The following pages link to On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641):
Displaying 20 items.
- Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- Rational relations and rational series (Q1194313) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- Rational subsets of partially reversible monoids (Q2378535) (← links)
- On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
- On the rational subsets of the monogenic free inverse monoid (Q2680819) (← links)
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid (Q3304144) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- On lindenmayerian rational subsets of monoids (Q4348240) (← links)
- The intersection problem for alphabetic vector monoids (Q4365015) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- Some decidable congruences of free monoids (Q4783813) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable (Q5204310) (← links)
- On the complexity of reasoning in Kleene algebra with commutativity conditions (Q6605343) (← links)
