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
[...]
TL;DR: The main purpose of this article is to propose key features and requirements of well designed automata simulator and to present the tool SimStudio -- integrated simulator of finite automaton, pushdown Automaton, Turing machine, RAM with extension and abacus machine.
Abstract: Software simulation tools supporting a teaching process are highly accepted by both teachers and students. We discuss the possibility of using automata simulators in theoretical computer science courses. The main purpose of this article is to propose key features and requirements of well designed automata simulator and to present our tool SimStudio -- integrated simulator of finite automaton, pushdown automaton, Turing machine, RAM with extension and abacus machine. The aim of this paper is to report our experiences with using of our automata simulators in teaching of the course "Fundamentals of Theoretical Computer Science" in bachelor educational program in software engineering held at Faculty of Informatics and Information Technologies, Slovak University of Technology in Bratislava.
6 citations
TL;DR: A language L is defined and shown that it can be recognized by no two-way nondeterministic sensing multihead finite automaton with na reversal bound, where n is the length of input words, and 1/3>a>0 is a real number.
Abstract: We define a language L and show that it can be recognized by no two-way nondeterministic sensing multihead finite automaton with na reversal bound, where n is the length of input words, and 1/3>a>0 is a real number. Since L is recognized by a two-way deterministic two-head finite automaton working in linear time we obtain, for two-way finite automata, that time, reading heads, and nondeterminism as resources cannot compensate for the reversal number restriction.
6 citations
TL;DR: The result that any nondeterministic pushdown automaton augmented with reversal-bounded counters, where the pushdown can “flip” its contents a bounded number of times, can be accepted by a machine with only reversal- bounded counters is obtained.
Abstract: The store language of a machine of some arbitrary type is the set of all store configurations (state plus store contents but not input) that can appear in an accepting computation. New algorithms and characterizations of store languages are obtained, such as the result that any nondeterministic pushdown automaton augmented with reversal-bounded counters, where the pushdown can “flip” its contents a bounded number of times, can be accepted by a machine with only reversal-bounded counters. Connections are made between store languages and several model checking and reachability problems, such as accepting the set of all predecessor and successor configurations of a machine from a given (regular) set of configurations. For a variety of different machine models often containing multiple parallel data stores, these sets can be accepted with a machine model that is simpler than the original model itself. Store languages are key to showing these properties.
6 citations
TL;DR: It is shown that, if the probabilistic automaton is completely isolated by the (0, k )th approximation and satisfies some conditions, then the finite automaton can behave expediently against the Probabilistic Automaton.
6 citations
TL;DR: A transformation on the automaton is described which makes it amenable to calculations of the probability of deadlock, and it is indicated that the procedures described can also be applied to other types of probabilistic automata modeling other deadlock situations.
6 citations