Visibly pushdown languages
From MaRDI portal
Publication:3580970
Recommendations
Cited in
(only showing first 100 items - show all)- Visibly pushdown transducers with look-ahead
- Reachability relations of timed pushdown automata
- Visibly linear dynamic logic
- Regular languages of nested words: fixed points, automata, and synchronization
- Model checking procedural programs
- Simple tree pattern matching for trees in the prefix bar notation
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- A survey of timed automata for the development of real-time systems
- Ordered multi-stack visibly pushdown automata
- Visibly rational expressions
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Space Complexity of Stack Automata Models
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Visibly rational expressions
- Generalizing input-driven languages: theoretical and practical benefits
- Model-checking structured context-free languages
- Leaf languages and string compression
- Conjunctive grammars and alternating pushdown automata
- Queries on XML streams with bounded delay and concurrency
- Streaming tree automata
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Scope-bounded pushdown languages
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- Operator precedence and the visibly pushdown property
- Annotated regular expressions and input-driven languages
- On regular tree languages and deterministic pushdown automata
- Synchronizing relations on words
- Descriptional complexity of input-driven pushdown automata
- Bounded Delay and Concurrency for Earliest Query Answering
- An automata-theoretic approach to infinite-state systems
- Event-Clock Visibly Pushdown Automata
- On the Membership Problem for Visibly Pushdown Languages
- Automata, Languages and Programming
- Query Automata for Nested Words
- Model checking probabilistic systems against pushdown specifications
- Visibly linear temporal logic
- P-hardness of the emptiness problem for visibly pushdown languages
- Automata for XML -- a survey
- Propositional dynamic logic with recursive programs
- Evolving schemas for streaming XML
- Parametric random generation of deterministic tree automata
- Rewriting of visibly pushdown languages for XML data integration
- Branching-time logics with path relativisation
- Shuffled languages -- representation and recognition
- A fragment of ML decidable by visibly pushdown automata
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Queue Automata: Foundations and Developments
- scientific article; zbMATH DE number 7447746 (Why is no real title available?)
- Revisiting underapproximate reachability for multipushdown systems
- Rigid Tree Automata
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}
- Automata-based verification of programs with tree updates
- Summarization for termination: No return!
- Regularity Problems for Visibly Pushdown Languages
- Rigid tree automata and applications
- Descriptional complexity of unambiguous input-driven pushdown automata
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Notions of hyperbolicity in monoids.
- Sofic-Dyck shifts
- Visibly Pushdown Transducers
- Simulation relations and applications in formal methods
- Realizability of Concurrent Recursive Programs
- A complete refinement procedure for regular separability of context-free languages
- 2-Visibly Pushdown Automata
- Space complexity of stack automata models
- Functions with local state: regularity and undecidability
- Fine hierarchies and m-reducibilities in theoretical computer science
- Scope-bounded pushdown languages
- Hardest languages for conjunctive and Boolean grammars
- Efficient determinization of visibly and height-deterministic pushdown automata
- Static analysis of XML security views and query rewriting
- Edit-distance between visibly pushdown languages
- Visibly pushdown transducers
- Logics for weighted timed pushdown automata
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- On the decidability of infix inclusion problem
- Consensus string problem for multiple regular languages
- Checking regular invariance under tightly-controlled string modifications
- Word equations in the context of string solving
- Third-order Idealized Algol with iteration is decidable
- String analysis as an abstract interpretation
- Program synthesis for interactive-security systems
- Precedence automata and languages
- Input-driven languages are linear conjunctive
- Input-driven pushdown automata on well-nested infinite strings
- CaRet with forgettable past
- Early nested word automata for XPath query answering on XML streams
- scientific article; zbMATH DE number 7770056 (Why is no real title available?)
- A logical characterization of timed pushdown languages
- Temporal logic with recursion
- Trimming visibly pushdown automata
- Digging input-driven pushdown automata
- Algorithmic games for full ground references
- Additive number theory via automata theory
- Sums of Palindromes: an Approach via Automata
- Temporal Logic with Recursion.
- The word problem for visibly pushdown languages described by grammars
- Temporal logics with language parameters
- An Infinite Automaton Characterization of Double Exponential Time
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)
