Congruences for visibly pushdown languages

DOI10.1007/11523468_89MaRDI QIDQ5716856zbMATH OpenOpenAlexFDO

Authors Viraj Kumar, Parthasarathy Madhusudan, Mahesh Viswanathan, Rajeev Alur

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468, http://hdl.handle.net/2142/11214

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Visibly pushdown languages
• Regularity Problems for Visibly Pushdown Languages
• Minimizing Variants of Visibly Pushdown Automata
• Beyond Language Equivalence on Visibly Pushdown Automata
• On the Membership Problem for Visibly Pushdown Languages

Cited in

(38)

• Nondeterministic state complexity of nested word automata
• Operational state complexity of nested word automata
• Trimming visibly pushdown automata
• Verification of opacity and diagnosability for pushdown systems
• State complexity of operations on input-driven pushdown automata
• Visibly rational expressions
• The word problem for visibly pushdown languages described by grammars
• Visibly rational expressions
• Arbology: trees and pushdown automata
• The Boolean formula value problem as formal language
• Descriptional complexity of input-driven pushdown automata
• Minimization of visibly pushdown automata using partial Max-SAT
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Minimizing Variants of Visibly Pushdown Automata
• Visibly pushdown languages
• A Grammatical Representation of Visibly Pushdown Languages
• State Complexity of Nested Word Automata
• Invisible pushdown languages
• Descriptional complexity of unambiguous input-driven pushdown automata
• Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
• Minimization of visibly pushdown automata is NP-complete
• Visibly Pushdown Transducers for Approximate Validation of Streaming XML
• Regularity Problems for Visibly Pushdown Languages
• Limitations of lower bound methods for deterministic nested word automata
• Never-stop context-free learning
• A survey of model learning techniques for recurrent neural networks
• From languages to behaviors and back
• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Validating streaming JSON documents with learned VPAs
• A closer look at the expressive power of logics based on word equations
• On the decidability and expressive power of several theories based on string constraints
• The \(\text{AC}^0\)-complexity of visibly pushdown languages
• Probabilistic input-driven pushdown automata
• The pumping lemma for context-free languages is undecidable
• The \(\mathsf{AC}^0\)-complexity of visibly pushdown languages
• Visibly pushdown languages in groups
• Visibly recursive automata
• Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}

This page was built for publication: Congruences for visibly pushdown languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716856)