Skip to search formSkip to main contentSkip to account menu

Nested word

Known as: Nested word automata, Visibly pushdown automaton, Visibly pushdown language 
In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Question Answering (QA) systems over Knowledge Graphs (KG) automatically answer natural language questions using facts contained… 
2014
2014
Ultimate Automizer is an automatic software verification tool for C programs. This tool is a prototype implementation of an… 
2012
2012
Temporal logics for nested words are a specification formalism for procedural programs, since they express requirements about… 
2012
2012
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown… 
2012
2012
The Boolean formula value problem asks for the Boolean output value of a given input formula. We code it as a formal language… 
2011
2011
We consider the problem of evaluating in streaming (i.e. in a single left-to-right pass) a nested word transduction with a… 
2008
2008
We present an extension of past time LTL with call/return atoms, called ptCaRet , together with a monitor synthesis algorithm for… 
Highly Cited
2008
Highly Cited
2008
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper… 
2006
2006
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can…