The following pages link to Visibly pushdown languages (Q3580970):
Displaying 50 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Static analysis of XML security views and query rewriting (Q462481) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Simple tree pattern matching for trees in the prefix bar notation (Q496555) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Evolving schemas for streaming XML (Q638517) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Rewriting of visibly pushdown languages for XML data integration (Q719268) (← links)
- Annotated regular expressions and input-driven languages (Q783684) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Notions of hyperbolicity in monoids. (Q846368) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- A note on an extension of PDL (Q959057) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Streaming tree automata (Q975511) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Program synthesis for interactive-security systems (Q1696589) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- CaRet With Forgettable Past (Q4982130) (← links)
- (Q5005113) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- (Q5089282) (← links)
- (Q5090478) (← links)
- (Q5136340) (← links)
- Temporal Logic with Recursion. (Q6060093) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q6131193) (← links)
