Pages that link to "Item:Q3449493"
From MaRDI portal
The following pages link to On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (Q3449493):
Displaying 4 items.
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES (Q5462124) (← links)