Visibly pushdown languages
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On regular tree languages and deterministic pushdown automata
- Algorithmic games for full ground references
- Visibly pushdown transducers
- Program synthesis for interactive-security systems
- Generalizing input-driven languages: theoretical and practical benefits
- Hardest languages for conjunctive and Boolean grammars
- Efficient determinization of visibly and height-deterministic pushdown automata
- Operator precedence and the visibly pushdown property
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- Grammatical characterizations of NPDAs and VPDAs with counters
- Weighted register automata and weighted logic on data words
- Visibly linear dynamic logic
- P-hardness of the emptiness problem for visibly pushdown languages
- Parametric random generation of deterministic tree automata
- Additive number theory via automata theory
- Consensus string problem for multiple regular languages
- Temporal logic with recursion
- Logic for \(\omega\)-pushdown automata
- On the determinization of event-clock input-driven pushdown automata
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Context-free timed formalisms: robust automata and linear temporal logics
- Input-driven pushdown automata on well-nested infinite strings
- Colored nested words
- Word equations in the context of string solving
- Checking regular invariance under tightly-controlled string modifications
- On the decidability of infix inclusion problem
- On the power of pushing or stationary moves for input-driven pushdown automata
- Multi-matching nested relations
- Reachability relations of timed pushdown automata
- Temporal logics with language parameters
- On the overlap assembly of strings and languages
- Trimming visibly pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Early nested word automata for XPath query answering on XML streams
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Conjunctive grammars and alternating pushdown automata
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Visibly rational expressions
- The word problem for visibly pushdown languages described by grammars
- Third-order Idealized Algol with iteration is decidable
- Input-driven languages are linear conjunctive
- Propositional dynamic logic with recursive programs
- A complete refinement procedure for regular separability of context-free languages
- Contextual approximation and higher-order procedures
- A perfect class of context-sensitive timed languages
- Cost register automata for nested words
- Visibly pushdown transducers with look-ahead
- Operator precedence languages: their automata-theoretic and logic characterization
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- Logics for weighted timed pushdown automata
- Conjunctive visibly-pushdown path queries
- Visibly rational expressions
- When input-driven pushdown automata meet reversiblity
- Edit-distance between visibly pushdown languages
- ML and extended branching VASS
- Precedence automata and languages
- Hybrid and first-order complete extensions of CaRet
- A fragment of ML decidable by visibly pushdown automata
- Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
- String analysis as an abstract interpretation
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- The Boolean formula value problem as formal language
- Descriptional complexity of input-driven pushdown automata
- Model checking procedural programs
- Weighted register automata and weighted logic on data words
- Synchronization of Regular Automata
- Query Automata for Nested Words
- A logical characterization of timed pushdown languages
- Minimization of visibly pushdown automata using partial Max-SAT
- Sums of Palindromes: an Approach via Automata
- Timed context-free temporal logics
- Ordered multi-stack visibly pushdown automata
- Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
- On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Visibly Pushdown Transducers
- Language Strength Reduction
- On the Membership Problem for Visibly Pushdown Languages
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- An Infinite Automaton Characterization of Double Exponential Time
- Extensional Uniformity for Boolean Circuits
- An automata-theoretic approach to infinite-state systems
- Event-Clock Visibly Pushdown Automata
- A Grammatical Representation of Visibly Pushdown Languages
- Realizability of Concurrent Recursive Programs
- Bounded Delay and Concurrency for Earliest Query Answering
- Rigid Tree Automata
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
- Beyond Language Equivalence on Visibly Pushdown Automata
- Nested Sibling Tree Automata
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Branching-time logics with path relativisation
- Shuffled languages -- representation and recognition
- A survey of timed automata for the development of real-time systems
- Model checking probabilistic systems against pushdown specifications
- Static analysis of XML security views and query rewriting
- Invisible pushdown languages
- Descriptional complexity of unambiguous input-driven pushdown automata
- Simple tree pattern matching for trees in the prefix bar notation
This page was built for publication: Visibly pushdown languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580970)
