Pages that link to "Item:Q1099641"

The following pages link to On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641):

Displaying 10 items.

• Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
• Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
• Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
• Rational relations and rational series (Q1194313) (← links)
• String matching problems over free partially commutative monoids (Q1207940) (← links)
• On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
• (Q3304144) (← links)
• Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← 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)