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 published on a yearly basis
Papers
More filters
06 Apr 1992
TL;DR: Guest-host electrooptical displays including a mixture of one or more of the compounds with a suitable pleochroic dye exhibit much improved constrast and low driving voltage while eliminating the need for polarizers and excessive dye additions.
Abstract: A simulation ‘free of cost’ of polynomially ambiguity bounded AuxPDAs by unambiguous ones is given. From this it follows that context free languages (CFLs) of polynomial ambiguity can be recognized as efficiently by unambiguous auxiliary pushdown automata (AuxPDAs) as unambiguous CFLs (UCFLs). Furthermore, a first nontrivial upper bound for a circuit class defined by Lange and its closure under complementation are indicated. Finally, normal forms for AuxPDAs are investigated; inter alia it is shown that several kinds of AuxPDAs can be made oblivious, i.e., the movements of all heads are independent from the input.
9 citations
Journal Article•
TL;DR: It is shown that between nondeterministic pushdown automata and any level of the hierarchy there are savings in the size of description which cannot be bounded by any recursive function.
Abstract: We investigate the descriptional complexity of deterministic restarting automata, an automaton model inspired from linguistics. Variants of deterministic and monotone restarting automata build a strict hierarchy whose top is characterized by the Church-Rosser languages and whose bottom is characterized by the deterministic context-free languages. It is shown that between nondeterministic pushdown automata and any level of the hierarchy there are savings in the size of description which cannot be bounded by any recursive function. Interestingly, the converse is also true for the Church-Rosser languages. Moreover, there are non-recursive trade-offs between the family of Church-Rosser languages and any other level of the hierarchy.
9 citations
TL;DR: The characterization of algebraic concepts such as subautomaton, retrievability and connectivity of a fuzzy automaton in terms of its layers, and to associate upper semilattices with fuzzy automata are characterized.
Abstract: This paper is towards the characterization of algebraic concepts such as subautomaton, retrievability and connectivity of a fuzzy automaton in terms of its layers, and to associate upper semilattices with fuzzy automata. Meanwhile, we provide a decomposition of a fuzzy automaton in terms of its layers and propose a construction of a fuzzy automaton corresponding to a given finite partially ordered set (poset). Finally, we establish an isomorphism between the poset of class of subautomata of a fuzzy automaton and an upper semilattice.
9 citations
15 Dec 2017
TL;DR: This work introduces and investigates stack transducers, which are one-way stack automata with an output tape that combines a classical pushdown automaton with the additional ability to move the input tape.
Abstract: We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move ...
9 citations
TL;DR: This correspondence presents an example of a two-way automaton which has significantly fewer states than any one- way automaton accepting the same set of tapes, and memory space can be saved by using this automaton.
Abstract: This correspondence presents an example of a two-way automaton which has significantly fewer states than any one-way automaton accepting the same set of tapes. Thus, in this particular case, memory space can be saved by using a two-way automaton. This savings in space, however, is accompanied by an increase in recognition time.
9 citations