The following pages link to Visibly pushdown languages (Q3580970):
Displaying 50 items.
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- Colored nested words (Q2149962) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Checking regular invariance under tightly-controlled string modifications (Q2163978) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- On the power of pushing or stationary moves for input-driven pushdown automata (Q2164744) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Temporal logics with language parameters (Q2232279) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Early nested word automata for XPath query answering on XML streams (Q2344752) (← links)
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems (Q2348371) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- Visibly rational expressions (Q2453980) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Third-order Idealized Algol with iteration is decidable (Q2474055) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Contextual Approximation and Higher-Order Procedures (Q2811338) (← links)
- A Perfect Class of Context-Sensitive Timed Languages (Q2817374) (← links)
- Cost Register Automata for Nested Words (Q2817901) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (Q2946409) (← links)
- Logics for Weighted Timed Pushdown Automata (Q2947171) (← links)
- Conjunctive Visibly-Pushdown Path Queries (Q2947891) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- Precedence Automata and Languages (Q3007634) (← links)
- Hybrid and First-Order Complete Extensions of CaRet (Q3010360) (← links)
- A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
- Verification of Common Interprocedural Compiler Optimizations Using Visibly Pushdown Kleene Algebra (Q3067464) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- The Boolean Formula Value Problem as Formal Language (Q3166948) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- Synchronization of Regular Automata (Q3182910) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- A Logical Characterization of Timed Pushdown Languages (Q3194716) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Sums of Palindromes: an Approach via Automata (Q3304153) (← links)
- (Q3384894) (← links)
- Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (Q3451099) (← links)
- On Distinguishing NC $$^1$$ and NL (Q3451114) (← links)
