Pages that link to "Item:Q3304129"

The following pages link to The intersection problem for finite monoids (Q3304129):

Displaying 11 items.

• The complexity of intersecting finite automata having few final states (Q347114) (← links)
• An intersection problem for finite automata (Q1118410) (← links)
• Restriction and intersection theorems -- the nonmonotone case (Q1382435) (← links)
• Intersection non-emptiness and hardness within polynomial time (Q1622971) (← links)
• On a transport problem and monoids of non-negative integers (Q1662421) (← links)
• The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
• Deciding FO-definability of regular languages (Q2695357) (← links)
• (Q3172131) (← links)
• The intersection problem for alphabetic vector monoids (Q4365015) (← links)
• The Intersection Problem for Finite Semigroups (Q5859649) (← links)
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)