The following pages link to (Q3341935):
Displaying 16 items.
- Leaf languages and string compression (Q550251) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Sums of Palindromes: an Approach via Automata (Q3304153) (← links)
- (Q3384888) (← links)
- (Q5005113) (← links)
- Weighted Operator Precedence Languages (Q5111245) (← links)
- Input-Driven Double-Head Pushdown Automata (Q6114870) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)