Pages that link to "Item:Q1132636"

The following pages link to A decision procedure for the order of regular events (Q1132636):

Displaying 14 items.

• Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
• Bounded regular path queries in view-based data integration (Q989472) (← links)
• Limitedness theorem on finite automata with distance functions (Q1050772) (← links)
• Representation theorems on regular languages (Q1052828) (← links)
• Rational languages and the Burnside problem (Q1079380) (← links)
• Algorithms for determining relative star height and star height (Q1118420) (← links)
• Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
• Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
• Exponential upper and lower bounds for the order of a regular language (Q1341751) (← links)
• New upper bounds to the limitedness of distance automata (Q1575957) (← links)
• The finite power problem revisited. (Q1853154) (← links)
• The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
• Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
• The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets (Q4717041) (← links)