Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68079OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716856

Mahesh Viswanathan, P. Madhusudan, Viraj Kumar, 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ The Boolean Formula Value Problem as Formal Language ⋮ Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Verification of opacity and diagnosability for pushdown systems ⋮ Unnamed Item ⋮ State complexity of operations on input-driven pushdown automata ⋮ Never-stop context-free learning ⋮ A survey of model learning techniques for recurrent neural networks ⋮ From languages to behaviors and back ⋮ Weighted Logics for Nested Words and Algebraic Formal Power Series ⋮ Visibly rational expressions ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Nondeterministic state complexity of nested word automata ⋮ Operational state complexity of nested word automata ⋮ Visibly Pushdown Transducers for Approximate Validation of Streaming XML ⋮ Unnamed Item ⋮ State Complexity of Nested Word Automata ⋮ Trimming visibly pushdown automata