Visibly pushdown languages
From MaRDI portal
Publication:3580970
DOI10.1145/1007352.1007390zbMATH Open1192.68396DBLPconf/stoc/AlurM04OpenAlexW2151033407WikidataQ29038653 ScholiaQ29038653MaRDI QIDQ3580970FDOQ3580970
Authors: Parthasarathy Madhusudan, Rajeev Alur 
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_papers/191
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (only showing first 100 items - show all)
- Additive number theory via automata theory
- A perfect class of context-sensitive timed languages
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- A note on an extension of PDL
- Context-free timed formalisms: robust automata and linear temporal logics
- When input-driven pushdown automata meet reversiblity
- Cost register automata for nested words
- Digging input-driven pushdown automata
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- ML and extended branching VASS
- Trimming visibly pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- The word problem for visibly pushdown languages described by grammars
- Third-order Idealized Algol with iteration is decidable
- Sums of Palindromes: an Approach via Automata
- Temporal logics with language parameters
- On the decidability of infix inclusion problem
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- Temporal Logic with Recursion.
- Conjunctive visibly-pushdown path queries
- Early nested word automata for XPath query answering on XML streams
- On the determinization of event-clock input-driven pushdown automata
- Colored nested words
- Algorithmic games for full ground references
- Beyond Language Equivalence on Visibly Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- Consensus string problem for multiple regular languages
- Title not available (Why is that?)
- Checking regular invariance under tightly-controlled string modifications
- Word equations in the context of string solving
- String analysis as an abstract interpretation
- Weighted register automata and weighted logic on data words
- Weighted register automata and weighted logic on data words
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- VLDL satisfiability and model checking via tree automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Temporal logic with recursion
- An Infinite Automaton Characterization of Double Exponential Time
- Logics for weighted timed pushdown automata
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Input-driven languages are linear conjunctive
- Logic for \(\omega\)-pushdown automata
- Multi-matching nested relations
- Synchronization of Regular Automata
- On the overlap assembly of strings and languages
- Program synthesis for interactive-security systems
- Visibly pushdown transducers
- Precedence automata and languages
- Edit-distance between visibly pushdown languages
- CaRet with forgettable past
- Input-driven pushdown automata on well-nested infinite strings
- A logical characterization of timed pushdown languages
- Nested Sibling Tree Automata
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
- Title not available (Why is that?)
- Verifying quantitative temporal properties of procedural programs
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Input-driven pushdown automata for edit distance neighborhood
- Title not available (Why is that?)
- State complexity of the quotient operation on input-driven pushdown automata
- A closer look at the expressive power of logics based on word equations
- Title not available (Why is that?)
- Language Strength Reduction
- Never-stop context-free learning
- On the power of pushing or stationary moves for input-driven pushdown automata
- From languages to behaviors and back
- Streaming ranked-tree-to-string transducers
- Contextual approximation and higher-order procedures
- The Boolean formula value problem as formal language
- Theoretical computer science: computational complexity
- Title not available (Why is that?)
- On the decidability of infix inclusion problem
- Descriptional complexity of finite automata -- selected highlights
- A Branching Time Variant of CaRet
- Hybrid and first-order complete extensions of CaRet
- A survey on automata with translucent letters
- Sweeping input-driven pushdown automata
- Extensional Uniformity for Boolean Circuits
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- Stack-aware hyperproperties
- Invisible pushdown languages
- Schema-based automata determinization
- Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
- On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
- Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
- Synchronization of Parikh automata
- Ramsey goes visibly pushdown
- Sliding windows over context-free languages
- Interval Temporal Logic for Visibly Pushdown Systems
- Validating streaming JSON documents with learned VPAs
- A temporal logic for higher-order functional programs
- Alternation is strict for higher-order modal fixpoint logic
- Title not available (Why is that?)
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
- A Grammatical Representation of Visibly Pushdown Languages
Uses Software
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)
