scispace - formally typeset
Search or ask a question
Topic

Pushdown automaton

About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The investigation of automata and languages defined over a one letter alphabet shows interesting differences with respect to the case of alphabets with at least two letters, and unary two-way automata are given emphasis, as well as unary versions of other computational models, as probabilistic automata, one-way and two- way pushdown automata.
Abstract: The investigation of automata and languages defined over a one letter alphabet shows interesting differences with respect to the case of alphabets with at least two letters. Probably, the oldest example emphasizing one of these differences is the collapse of the classes of regular and context-free languages in the unary case (Ginsburg and Rice, 1962). Many differences have been proved concerning the state costs of the simulations between different variants of unary finite state automata (Chrobak, 1986, Mereghetti and Pighizzini, 2001). We present an overview of these results. Because important connections with fundamental questions in space complexity, we give emphasis to unary two-way automata. Furthermore, we discuss unary versions of other computational models, as probabilistic automata, one-way and two-way pushdown automata, even extended with auxiliary workspace, and multi-head automata.

5 citations

Book ChapterDOI
18 Jun 2013
TL;DR: This work introduces here operator precedence ω-languages (ωOPLs), investigating various acceptance criteria and their closure properties, and shows the gain in expressiveness and verifiability offered by ωopLs w.r.t. smaller classes.
Abstract: Recent literature extended the analysis of ω-languages from the regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator precedence languages (OPLs), instead, were originally defined to support deterministic parsing and exhibit interesting relations with these classes of languages: OPLs strictly include VPLs, enjoy all relevant closure properties and have been characterized by a suitable automata family and a logic notation. We introduce here operator precedence ω-languages (ωOPLs), investigating various acceptance criteria and their closure properties. Whereas some properties are natural extensions of those holding for regular languages, others require novel investigation techniques.Application-oriented examples show the gain in expressiveness and verifiability offered by ωOPLs w.r.t. smaller classes.

5 citations

Journal ArticleDOI
TL;DR: This result acts as a complete relationship between languages of type r − generated by SE-systems of type (reg,reg,f) and stack languages of pushdown automata.

5 citations

Journal ArticleDOI
TL;DR: The aim of this paper is to address the open problem of determinism in DPDT, as discussed in [1], by proposing a deterministic DDPDT (DDPDT), which is strictly deterministic as well as deterministic with respect to depth.
Abstract: Deep pushdown transducers (DPDT) are deterministic with respect to depth, but they lack strict determinism. The aim of this paper is to address the open problem of determinism in DPDT, as discussed in [1], by proposing a deterministic DPDT (DDPDT). Furthermore, we also explore a parallel variant of a DDPDT. The proposed deterministic models are strictly deterministic as well as deterministic with respect to depth. We support this discussion of these transducers with numerical examples. Furthermore, relationships among deterministic transducers, non-strict deterministic transducers and their parallel variants will be discussed.

5 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
87% related
Finite-state machine
15.1K papers, 292.9K citations
86% related
Model checking
16.9K papers, 451.6K citations
84% related
Concurrency
13K papers, 347.1K citations
84% related
String (computer science)
19.4K papers, 333.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202234
202129
202052
201947
201834