Pages that link to "Item:Q1249047"

The following pages link to Effective constructions in well-partially-ordered free monoids (Q1249047):

Displaying 18 items.

• Decidability of involution hypercodes (Q401315) (← links)
• Homomorphic images of sentential form languages defined by semi-Thue systems (Q795513) (← links)
• The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
• On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
• Hierarchies of hyper-AFLs (Q1058860) (← links)
• On total regulators generated by derivation relations (Q1084874) (← links)
• On well quasi orders of free monoids (Q1275465) (← links)
• On quasi orders of words and the confluence property (Q1276254) (← links)
• General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
• State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
• Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
• The size of Higman-Haines sets (Q2465049) (← links)
• Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
• An Approach to Computing Downward Closures (Q3449495) (← links)
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
• (Q5111264) (← links)
• Further closure properties of input-driven pushdown automata (Q5919707) (← links)
• Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)