Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,238,681 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Automata theory
Boolean circuit
Chomsky hierarchy
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Neural Network-based Question Answering over Knowledge Graphs on Word and Character Level
Denis Lukovnikov
,
Asja Fischer
,
Jens Lehmann
,
S. Auer
The Web Conference
2017
Corpus ID: 12983389
Question Answering (QA) systems over Knowledge Graphs (KG) automatically answer natural language questions using facts contained…
Expand
2015
2015
Descriptional complexity of unambiguous input-driven pushdown automata
A. Okhotin
,
K. Salomaa
Theoretical Computer Science
2015
Corpus ID: 14053822
2014
2014
Ultimate Automizer with Unsatisfiable Cores - (Competition Contribution)
Matthias Heizmann
,
Jürgen Christ
,
+6 authors
A. Podelski
International Conference on Tools and Algorithms…
2014
Corpus ID: 12938542
Ultimate Automizer is an automatic software verification tool for C programs. This tool is a prototype implementation of an…
Expand
2012
2012
A Temporal Logic for Multi-threaded Programs
S. L. Torre
,
M. Napoli
IFIP TCS
2012
Corpus ID: 17802616
Temporal logics for nested words are a specification formalism for procedural programs, since they express requirements about…
Expand
2012
2012
OpenNWA: A Nested-Word Automaton Library
E. Driscoll
,
Aditya V. Thakur
,
T. Reps
International Conference on Computer Aided…
2012
Corpus ID: 14638751
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown…
Expand
2012
2012
The Boolean Formula Value Problem as Formal Language
Klaus-Jörn Lange
Languages Alive
2012
Corpus ID: 43461265
The Boolean formula value problem asks for the Boolean output value of a given input formula. We code it as a formal language…
Expand
2011
2011
Streamability of nested word transductions
E. Filiot
,
Olivier Gauwin
,
Pierre-Alain Reynier
,
Frédéric Servais
Foundations of Software Technology and…
2011
Corpus ID: 2681590
We consider the problem of evaluating in streaming (i.e. in a single left-to-right pass) a nested word transduction with a…
Expand
2008
2008
Synthesizing Monitors for Safety Properties: This Time with Calls and Returns
Grigore Roşu
,
Feng Chen
,
T. Ball
Runtime Verification
2008
Corpus ID: 15217441
We present an extension of past time LTL with call/return atoms, called ptCaRet , together with a monitor synthesis algorithm for…
Expand
Highly Cited
2008
Highly Cited
2008
Weighted Logics for Nested Words and Algebraic Formal Power Series
Christian Mathissen
International Colloquium on Automata, Languages…
2008
Corpus ID: 14341796
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper…
Expand
2006
2006
Languages of Nested Trees
R. Alur
,
Swarat Chaudhuri
,
P. Madhusudan
International Conference on Computer Aided…
2006
Corpus ID: 11525516
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE