Pages that link to "Item:Q3522902"
From MaRDI portal
The following pages link to On the Membership Problem for Visibly Pushdown Languages (Q3522902):
Displaying 11 items.
- Rewriting of visibly pushdown languages for XML data integration (Q719268) (← links)
- Annotated regular expressions and input-driven languages (Q783684) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Sums of Palindromes: an Approach via Automata (Q3304153) (← links)
- Visibly pushdown languages (Q3580970) (← links)
- On the complexity of membership and counting in height-deterministic pushdown automata (Q3589625) (← links)
- (Q3976037) (← links)
- Automata, Languages and Programming (Q5716856) (← links)