Visibly pushdown languages
From MaRDI portal
Publication:3580970
Recommendations
Cited in
(only showing first 100 items - show all)- Word equations in the context of string solving
- String analysis as an abstract interpretation
- Weighted register automata and weighted logic on data words
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Weighted register automata and weighted logic on data words
- Operator precedence and the visibly pushdown property
- Extensional Uniformity for Boolean Circuits
- A survey on automata with translucent letters
- Sweeping input-driven pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- On the power of pushing or stationary moves for input-driven pushdown automata
- Synchronizing relations on words
- Temporal logic with recursion
- VLDL satisfiability and model checking via tree automata
- An Infinite Automaton Characterization of Double Exponential Time
- Ordered multi-stack visibly pushdown automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Efficient determinization of visibly and height-deterministic pushdown automata
- Logics for weighted timed pushdown automata
- Descriptional complexity of input-driven pushdown automata
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
- Space Complexity of Stack Automata Models
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Rewriting of visibly pushdown languages for XML data integration
- Rigid tree automata and applications
- 2-Visibly Pushdown Automata
- Parametric random generation of deterministic tree automata
- Event-Clock Visibly Pushdown Automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- Invisible pushdown languages
- Stack-aware hyperproperties
- Input-driven languages are linear conjunctive
- Regularity Problems for Visibly Pushdown Languages
- Simple tree pattern matching for trees in the prefix bar notation
- Logic for \(\omega\)-pushdown automata
- Schema-based automata determinization
- Rigid Tree Automata
- Annotated regular expressions and input-driven languages
- Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
- On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
- Scope-bounded pushdown languages
- A fragment of ML decidable by visibly pushdown automata
- Multi-matching nested relations
- On the overlap assembly of strings and languages
- Synchronization of Regular Automata
- Verification of common interprocedural compiler optimizations using visibly pushdown Kleene algebra
- Program synthesis for interactive-security systems
- Visibly pushdown transducers with look-ahead
- Synchronization of Parikh automata
- Ramsey goes visibly pushdown
- Sliding windows over context-free languages
- Visibly Pushdown Transducers
- Bounded Delay and Concurrency for Earliest Query Answering
- Queue Automata: Foundations and Developments
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Simulation relations and applications in formal methods
- Interval Temporal Logic for Visibly Pushdown Systems
- Alternation is strict for higher-order modal fixpoint logic
- Validating streaming JSON documents with learned VPAs
- A temporal logic for higher-order functional programs
- scientific article; zbMATH DE number 7447746 (Why is no real title available?)
- Visibly pushdown transducers
- scientific article; zbMATH DE number 7168150 (Why is no real title available?)
- Generalizing input-driven languages: theoretical and practical benefits
- Branching-time logics with path relativisation
- Shuffled languages -- representation and recognition
- Precedence automata and languages
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
- Edit-distance between visibly pushdown languages
- Input-driven pushdown automata on well-nested infinite strings
- Notions of hyperbolicity in monoids.
- A logical characterization of timed pushdown languages
- 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
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)
