Pages that link to "Item:Q761043"

The following pages link to Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043):

Displayed 4 items.

• On deciding trace equivalences for processes (Q1310916) ‎ (← links)
• A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) ‎ (← links)
• Classifying the computational complexity of problems (Q3781088) ‎ (← links)
• Graph Ramsey theory and the polynomial hierarchy (Q5943091) ‎ (← links)