Visibly pushdown languages
From MaRDI portal
Publication:3580970
Recommendations
Cited in
(only showing first 100 items - show all)- Functions with local state: regularity and undecidability
- A Grammatical Representation of Visibly Pushdown Languages
- CaRet with forgettable past
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- A survey of timed automata for the development of real-time systems
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- Scope-bounded pushdown languages
- Minimization of visibly pushdown automata using partial Max-SAT
- Model checking probabilistic systems against pushdown specifications
- Evolving schemas for streaming XML
- Input-driven multi-counter automata
- Additive number theory via automata theory
- A perfect class of context-sensitive timed languages
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Visibly linear temporal logic
- A complete refinement procedure for regular separability of context-free languages
- A note on an extension of PDL
- Model-checking structured context-free languages
- Space complexity of stack automata models
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}
- Nested Sibling Tree Automata
- Context-free timed formalisms: robust automata and linear temporal logics
- When input-driven pushdown automata meet reversiblity
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
- Cost register automata for nested words
- scientific article; zbMATH DE number 7577575 (Why is no real title available?)
- Verifying quantitative temporal properties of procedural programs
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Digging input-driven pushdown automata
- ML and extended branching VASS
- Automata-based verification of programs with tree updates
- Summarization for termination: No return!
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Leaf languages and string compression
- Queries on XML streams with bounded delay and concurrency
- Visibly linear dynamic logic
- scientific article; zbMATH DE number 7559138 (Why is no real title available?)
- Edit distance neighbourhoods of input-driven pushdown automata
- Input-driven pushdown automata for edit distance neighborhood
- State complexity of the quotient operation on input-driven pushdown automata
- A closer look at the expressive power of logics based on word equations
- Realizability of Concurrent Recursive Programs
- scientific article; zbMATH DE number 7559473 (Why is no real title available?)
- Trimming visibly pushdown automata
- Language Strength Reduction
- Hardest languages for conjunctive and Boolean grammars
- Automata, Languages and Programming
- Automata for XML -- a survey
- Edit distance neighbourhoods of input-driven pushdown automata
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- The word problem for visibly pushdown languages described by grammars
- Never-stop context-free learning
- On the power of pushing or stationary moves for input-driven pushdown automata
- Streaming tree automata
- Third-order Idealized Algol with iteration is decidable
- Model checking procedural programs
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Temporal logics with language parameters
- Sums of Palindromes: an Approach via Automata
- Query Automata for Nested Words
- Streaming ranked-tree-to-string transducers
- From languages to behaviors and back
- Reachability relations of timed pushdown automata
- On the decidability of infix inclusion problem
- Contextual approximation and higher-order procedures
- Revisiting underapproximate reachability for multipushdown systems
- P-hardness of the emptiness problem for visibly pushdown languages
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- An automata-theoretic approach to infinite-state systems
- On the Membership Problem for Visibly Pushdown Languages
- Fine hierarchies and m-reducibilities in theoretical computer science
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- The Boolean formula value problem as formal language
- Descriptional complexity of unambiguous input-driven pushdown automata
- Theoretical computer science: computational complexity
- Temporal Logic with Recursion.
- scientific article; zbMATH DE number 7471692 (Why is no real title available?)
- Sofic-Dyck shifts
- Conjunctive visibly-pushdown path queries
- On the decidability of infix inclusion problem
- Early nested word automata for XPath query answering on XML streams
- On the determinization of event-clock input-driven pushdown automata
- Colored nested words
- On regular tree languages and deterministic pushdown automata
- Visibly rational expressions
- Algorithmic games for full ground references
- Conjunctive grammars and alternating pushdown automata
- Visibly rational expressions
- Propositional dynamic logic with recursive programs
- Static analysis of XML security views and query rewriting
- Descriptional complexity of finite automata -- selected highlights
- A Branching Time Variant of CaRet
- Beyond Language Equivalence on Visibly Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- Hybrid and first-order complete extensions of CaRet
- Consensus string problem for multiple regular languages
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- Checking regular invariance under tightly-controlled string modifications
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)
