A Logical Characterization for Dense-Time Visibly Pushdown Automata

2016 ◽  
pp. 89-101 ◽  
Author(s):  
Devendra Bhave ◽  
Vrunda Dave ◽  
Shankara Narayanan Krishna ◽  
Ramchandra Phawade ◽  
Ashutosh Trivedi
Keyword(s):  
Visibly Pushdown Automata ◽  
Pushdown Automata

scholarly journals Trimming visibly pushdown automata

2015 ◽  
Vol 578 ◽  
pp. 13-29
Author(s):  
Mathieu Caralp ◽  
Pierre-Alain Reynier ◽  
Jean-Marc Talbot
Keyword(s):  
Visibly Pushdown Automata ◽  
Pushdown Automata

Visibly Pushdown Automata and Transducers with Counters

2016 ◽  
Vol 148 (3-4) ◽  
pp. 291-308 ◽  
Author(s):  
Oscar H. Ibarra
Keyword(s):  
Visibly Pushdown Automata ◽  
Pushdown Automata

State Complexity of the Quotient Operation on Input-Driven Pushdown Automata

2019 ◽  
Vol 30 (06n07) ◽  
pp. 1217-1235
Author(s):  
Alexander Okhotin ◽  
Kai Salomaa
Keyword(s):  
Regular Language ◽  
Formal Language ◽  
State Complexity ◽  
The Family ◽  
Visibly Pushdown Automata ◽  
Context Free ◽  
Pushdown Automata

The quotient of a formal language [Formula: see text] by another language [Formula: see text] is the set of all strings obtained by taking a string from [Formula: see text] that ends with a suffix of a string from [Formula: see text], and removing that suffix. The quotient of a regular language by any language is always regular, whereas the context-free languages and many of their subfamilies, such as the linear and the deterministic languages, are not closed under the quotient operation. This paper establishes the closure of the family of languages recognized by input-driven pushdown automata (IDPDA), also known as visibly pushdown automata, under the quotient operation. A construction of automata representing the result of the operation is given, and its state complexity with respect to nondeterministic IDPDA is shown to be exactly [Formula: see text], where [Formula: see text] and [Formula: see text] are the numbers of states in the automata recognizing [Formula: see text] and [Formula: see text], respectively.

scholarly journals Visibly Pushdown Transducers with Well-Nested Outputs

2016 ◽  
Vol 27 (02) ◽  
pp. 235-257 ◽  
Author(s):  
Pierre-Alain Reynier ◽  
Jean-Marc Talbot
Keyword(s):  
Model Transformations ◽  
Type Checking ◽  
Tree Transformations ◽  
Nested Words ◽  
Visibly Pushdown Automata ◽  
Pushdown Automata

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced oto model transformations of nested words, i.e. words with a call/return structure. When outputs are also structured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class of VPTs with well-nested outputs to be decidable in PTIME. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable.

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata

2015 ◽  
Vol 16 (4) ◽  
pp. 1-24
Author(s):  
Oliver Friedmann ◽  
Felix Klaedtke ◽  
Martin Lange
Keyword(s):  
Visibly Pushdown Automata ◽  
Pushdown Automata
Sign in / Sign up

Export Citation Format

Share Document