113 search results - page 4 / 23 » 2-Visibly Pushdown Automata |
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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
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...
DNA
2004
Springer
14 years 25 days ago
2004
Springer
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
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...