pushdown automaton
A Context Free Process as a Pushdown Automaton
... Due to the presence of 1, a context-free process may have unbounded branching [8] that we need to mimic with our pushdown automaton. One possible solution is to use forgetfulness of the stack to get this ...
7
Indexing Ordered Trees for (Nonlinear) Tree Pattern Matching by Pushdown Automata
... deterministic pushdown automaton (PDA) is an appro- priate model of computation for labelled ordered trees in linear notation and that the trees in postfix notation acceptable by deterministic PDA form a ...
30
Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness
... The ability to test the emptiness of L ( X ) is therefore equivalent to testing the freeness of S on X. There is a known algorithm that takes a context-free grammar and tests whether the language it defines is empty [7, ...
10
On Fuzzy Pushdown Automata and their Covering
... fuzzy pushdown automaton from given fuzzy pushdown automata (ii) to discuss decompositions of fuzzy pushdown automaton and (iii) to establish basic foundation for discussing closure ...
7
Reachability in pushdown register automata
... infinite-alphabet pushdown automaton [8] typically involves a refreshment (i • ) followed by pop (pop(j)) and a sequence of pushes ...register pushdown automata [20], an additional complication is ...
14
Reachability in pushdown register automata
... infinite-alphabet pushdown automaton [8] typically involves a refreshment (i • ) followed by pop (pop ( j ) ) and a sequence of pushes (push ( j ) ...register pushdown automata [22], an additional ...
27
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
... auxiliary pushdown automaton is a (deterministic or nondeterministic) logspace-bounded Turing machine, that also has a pushdown store that is not subject to the space ...auxiliary pushdown ...
17
Edit Distance for Pushdown Automata
... between pushdown automata and their ...a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the ...
13
Polynomial Time and Space Shift Reduce Parsing of Arbitrary Context free Grammars
... Tomita's encoding of the non-deterministic pushdown automaton suffers from an exponential time and space worst case complexity with respect to the input length and also with respect to t[r] ...
8
Modularization of Regular Growth Automata
... From a language theoretic perspective note that, as an ordinary finite state machine, it computes Nerode-equivalences. From a practi- cal perspective, the most remarkable property is that the automaton constructs ...
9
Geometric Representations of Interacting Maps
... Let us describe the BBS map T by an interaction of a family of interval maps. The basic method will take two steps. Firstly we will describe it by a proper Mealy automaton, and then we write down the ...
48
Timed pushdown automata and branching vector addition systems
... . Notice how palindromicity is re- quired also in the timestamps, which makes it impossible for L for be recognized without a truly timed stack. We construct trPDA P recognizing L with just two control states Q “ tp, qu ...
13
Volume 41: Graph Transformation and Visual Modeling Techniques 2011
... If we restrict an automaton functor 3 to atomic cospans of bounded interface size (see also Section 4, we obtain a structure which is basically a finite automaton. It is therefore not surprising that we can ...
13
Epidemic Propagation: An Automaton Model as the Continuous SIR Model
... cellular automaton model that well reproduces the time evolution of the disease given by the SIR model; setting the automaton is generally an annoying problem because we need to run a lot of simulations, ...
6
Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP
... JFLAP, the Java Formal Language and Automata Package, is the tool which was selected for this project. JFLAP is a very popular Java 1.4 / 1.5 Swing GUI from Duke University which allows the user to easily visualize and ...
70
On line Digit Set Conversion for Rational Digit Number
... 𝐸 = {−4, … , 4} to a digit set 𝒟 = {−1, … , 1} in a rational digit number where 𝑚 = 4 in a base 𝛽 = 3 can be performed by an on-line finite automaton. An on-line delay 𝑘 can be calculated from Lemma 2 that is ...
11
The word problem in Hanoi Towers groups
... letter: automaton reads the first letter from the current state, produces the output letter, and changes its state; the output letter and the new state depend only on the current state and the input ...an ...
8
Fuzzy $\omega$-Tree Automata
... tree automaton is also recognized by a fuzzy Muller tree ...tree automaton is also recognized by a fuzzy Muller tree automaton and ...tree automaton if and only if it is ...
6
Timed Watson-Crick Online Tessellation Automaton
... 2. Muller condition: A family F ⊆ 2 Q of final state sets is considered and Inf(r) ∈ F . Then L ω (M) is the ω-language consisting of the words x ∈ Σ ω such that M has an accepting run over x. An ω-language L is called ...
8
Automorphism Group of an Inverse Fuzzy Automaton
... An automaton is a model of a sequential switching circuit with a finite number of states,with state changing when it is subjected to an input ...an automaton and its input semigroup, outputs are not ...
7