Pages that link to "Item:Q5716856"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716856):
Displaying 19 items.
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Visibly rational expressions (Q2453980) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- (Q3165666) (← links)
- The Boolean Formula Value Problem as Formal Language (Q3166948) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Weighted Logics for Nested Words and Algebraic Formal Power Series (Q3519504) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- (Q5216306) (← links)
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML (Q5445303) (← links)
