Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,508,465 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.
2016
2016
Colored nested words
R. Alur
,
D. Fisman
Formal methods in system design
2016
Corpus ID: 9659341
Nested words allow modeling of linear and hierarchical structure in data, and nested word automata are special kinds of pushdown…
Expand
2015
2015
Model Checking Concurrent Systems Using Temporal Logics
Roy Mennicke
2015
Corpus ID: 44733797
In dieser Arbeit wird die Komplexitat der automatischen Verifikation von parallelen Systemen mittels Temporallogiken untersucht…
Expand
2015
2015
Infinite games recognized by 2-stack visibly pushdown automata (Proof Theory, Computation Theory and Related Topics)
Wenjuan Li
,
Shohei Okisaka
,
Kazuyuki Tanaka
2015
Corpus ID: 14915182
Two-player infinite games have been extensively studied in Descriptive Set Theory in the past several decades, accompanied by a…
Expand
2013
2013
Expressiveness of Visibly Pushdown Transducers
M. Caralp
,
E. Filiot
,
Pierre-Alain Reynier
,
Frédéric Servais
,
J. Talbot
TTATT
2013
Corpus ID: 9569639
Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. Theyhave been introduced to model…
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
WALi: Nested-Word Automata
E. Driscoll
,
Aditya V. Thakur
,
Amanda Burton
,
T. Reps
2011
Corpus ID: 69453882
WALi-NWA is a C++ library for constructing, querying, and operating on nested-word automata. It is a portion of the WALi library…
Expand
2011
2011
Software model checking using languages of nested trees
R. Alur
,
Swarat Chaudhuri
,
P. Madhusudan
TOPL
2011
Corpus ID: 7270996
While model checking of pushdown systems is by now an established technique in software verification, temporal logics and…
Expand
2010
2010
Counting Paths in VPA Is Complete for #NC1
Andreas Krebs
,
N. Limaye
,
M. Mahajan
Algorithmica
2010
Corpus ID: 17011222
We give a #NC1 upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton. Our algorithm…
Expand
2003
2003
The Equivalence Problem for t-Turn DPDA Is Co-NP
Géraud Sénizergues
International Colloquium on Automata, Languages…
2003
Corpus ID: 10940110
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing…
Expand
Review
1997
Review
1997
Early acquisition of syntactic categories: A formal model
T. A. Cartwright
,
M. Brent
1997
Corpus ID: 16600412
We propose an explicit, incremental strategy by which children could group words with similar syntactic privileges into discrete…
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