113 search results - page 2 / 23 » Height-Deterministic Pushdown Automata |
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
DLT
2009
13 years 5 months ago
2009
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
DLT
2006
13 years 8 months ago
2006
Abstract. We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the autom...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...