Pushdown automata and context-free languages
Intuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages
... fuzzy pushdown automata and ...Fuzzy Context Free Language with empty stack has an equivalent intuitionistic Fuzzy PDA that accepts the same language with final state and ...fuzzy ...
11
A Context Free Process as a Pushdown Automaton
... A Context-Free Process as a Pushdown Automaton Saurabh Setia 1 , Nipun Jain 2 , Paras Thakral 3 DCE,GGN Abstract: Pushdown automata are used in theories about what can be computed by ...
7
On Fuzzy Pushdown Automata and their Covering
... of automata [4, ...finite automata, in terms of congruences and homomorphism was discussed in ...class, pushdown automata, of automata was generalized to fuzzy pushdown ...
7
Pushdown Automata in Statistical Machine Translation
... that pushdown transducers, the extended version of PDA with input and output labels in each transition, do not have the expressive power needed to generate synchronous context-free ...regular ...
38
Acceptor Automata Of Middle Hamzah Rules Using Pushdown Automata
... 4.2. Pushdown Automata for Context Free languages Each move in PDA determined by the current state and current input symbol and the current symbol on the top of the stack then the ...
6
A linear time extension of deterministic pushdown automata
... stack+bag pushdown languages include the context-free languages and at least one language that is not context-free, namely {a n b n c n | n ≥ 0}, it follows that they ...
8
Timed pushdown automata and branching vector addition systems
... of languages recognized by PDAs (i.e., context-free languages) directly transfer to trPDA, such as closure under union, reversal, concatenation, iteration, images and inverse images of (timed) ...
13
On Languages of P Automata
... of context-free languages in terms of symport/antiport P sys- ...of pushdown automaton, P n-stack- automata are motivated by classical automata having n, possibly more than one ...
16
Context-free ambiguity detection using multi-stack pushdown automata
... multi-pushdown automata called bounded-balance multi-stack pushdown ...the context of language intersection, limiting the balances in a run has several advantages over limiting the number of ...
12
Dual pushdown automata and context sensitive grammars -
... In recent years, a number of generalizations of pushdown automata have been studied. The basic model of pushdown automata bears an equivalence relationship to context-free grammars as [r] ...
Single-letter languages accepted by alternating and probabilistic pushdown automata
... The usual ppa has the end marker # on the input tape which allows to process the content of pushdown after reading the input word. ppa without input has not such possibility: the number n being accepted is decided ...
12
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
... a context-free language defined over a one-letter alphabet is ...unary context-free grammars and unary pushdown automata can be transformed into equivalent finite ...finite ...
22
Edit Distance for Pushdown Automata
... source languages given as DPDA and target languages given as ...source languages given as PDA and target languages given as NFA the problem can be solved in ...source languages given by ...
13
Reachability in pushdown register automata
... “context-free” languages over infinite ...such automata are only capable of remembering r elements of the infinite alphabet over the course of a run — for any accepting run one can construct ...
14
Reachability in pushdown register automata
... for pushdown register automata, adding new results to the literature on automata over infinite alphabets ...the automata are equipped with unbounded stack storage, we have shown that their ...
27
Edit distance for pushdown automata
... source languages given as DPDA and target languages given as ...source languages given as PDA and target languages given as NFA the problem can be solved in ...source languages given by ...
13
CS 301. Lecture 12 Pushdown automata
... simple languages like {a n b n ∣ n ≥ 0} are too complicated What we want is some way to remember things about the input that we’ve seen so far which can be arbitrarily ...
One-variable context-free hedge automata
... hedge automata called One-Variable Context-Free Hedge ...tree languages they recognize has polynomial membership problem and is preserved by rewrite closure with inverse-monadic ...a ...
31
Push-down Automata and Context-free Grammars
... push-down automata (PDA) for vari- ous languages, the conversion of CFGs to PDAs, and vice ...push-down automata in Section ...for context-free grammars called the Chomsky normal ...
26
CiteSeerX — Context-Free Grammars and Languages
... A grammar is unambiguous if, at each leftmost-derivation step, there is only one rule that can lead to a derivation of the desired string... 3.5 Leftmost Derivations and Ambiguity[r] ...
23