I've been asked to find the PDA for the language L over the alphabet {a,b,c,d} where L={(a^p)(b^2p)(c^r)(d^s)| p,r,s > 0 AND r=s} I have solved it using 5 states but I must solve it using 6 states. Could anyone help me solve it? [1]: https://i.stack.imgur.com/pqYMQ.jpg
Push Down Automata Using Fixed States
134 Views Asked by suppaGonzalo At
1
There are 1 best solutions below
Related Questions in COMPUTER-SCIENCE
- 2D array - making it "torus" like
- How to get samples of different paths?
- How do I keep track of path in TSP?
- Need workaround to treat float values as tuples when updating "list" of float values
- How does a loop work at the lowest level
- Solving a complex recurrence relation for the Traveling Salesman
- Would this function be O(n^2log_2(n))?
- Watermark in a textbox c#/cs/aspx
- Writing a Recurrence Equation
- How to run Athena | Coq | Isabelle codes remotely?
- Computer Architecture/Assembly, Amdahl's Law
- Why is it that some user defined C++ functions won't work with big numbers?
- Quicksort Q: Finitely many distinct keys
- Computer architecture - How to find the addresses in a block
- Table seating, what algorithm to use?
Related Questions in FINITE-AUTOMATA
- i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b
- Converting DFA to RE
- Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'
- Does there exist a TM for all countable languages?
- How to find useless states in a finite state machine Prolog
- Can a RegEx with negative lookahead be represented as a finite automaton?
- Can final and non-final states having identical configurations be merged together in a minimal DFA?
- automata theorem: existance of a DFA
- Shortest regex for binary number with even number of 0s or odd number of 1s
- Coding a propositional logic parser by hand
- Modeling FSM with conditions?
- Finding DFA of r* when r and DFA of r were deifined
- How to Design an acceptor for integers in a programming language C
- Minimum number of states needed?
- What is the fastest way to compute an epsilon closure?
Related Questions in PUSHDOWN-AUTOMATON
- A pushdown automaton that recognizes the negation of a language
- Simple explanation of PDA accept states?
- how do you create a context free grammar for this language and pda?
- What type of languages are accepted by a PDA in which stack size is limited?
- Why the following language cannot be defined using a Pushdown Automata (PDA)?
- how to figure out what language a PDA recognizes
- Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program
- bounded PDA and context-free languages
- construct a pushdown automata for L={a^mb^n where n<=m<=2n}?
- accepting/rejecting Pushdown automata in haskell
- Repeated regex replace within bounds
- Deriving a state machine from a BNF grammar
- A Decidability Question
- How do I implement pushdown automaton in C#?
- How to solve this context free grammar
Related Questions in AUTOMATON
- Design NFA with changing alphabet and language
- A pushdown automaton that recognizes the negation of a language
- If pref(L) is regular, does that imply L is also regular?
- Scalability of aho corasick
- Deterministic automaton whose input length is divisible by 3 or 5?
- recognizing a date in the form: 03/02 for February 3 , For simplicity, we consider that each month is made up of 30 days
- Build a Turing Machine that counts a's and b's
- Design a nondeterministic finite automata in c++ (incorrect output)
- Why does my c++ program crashes at with a particular input?
- how would I build a generalized DFA for decimal Multiples of k?
- Moving from state to state in this automaton via HashMap
- How should I implement this HashMap's equals and hashCode methods to represent an automaton state?
- How can a Stack of Push Down Automata accept a string of Indefinitely Large?
- Stack around the variable 'userStr' was corrupted (C)
- Automaton DFA implementation not working using Java
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Take your 5-state PDA. Let's refer to its start state as q0. Construct a new 6-state PDA as follows:
add a new start state q* to your 5-state PDA; so, q0 is still a state in the newly constructed PDA, but it is not longer a start state.
add a transition from q* to q0 which requires the bottom-of-stack symbol Z0 to be on the top of the stack (i.e., the stack is empty) and which consumes no input whatever (epsilon/lambda transition).
You now have a 6-state PDA which accepts precisely the same language as your 5-state PDA.
Even simpler: add a new state which transitions to itself on all possible stack/input combinations, and which no other state in the 5-state PDA transitions to. This produces a 6-state PDA that accepts the same language as the 5-state PDA. Sure, the state graph is disconnected now, but I am not sure the state graph being connected by transitions is really a requirement in standard definitions of automata. Of course, it is silly to add states not reachable from the start state, but it is also silly to insist upon a 6-state PDA when you have a perfectly good 5-state PDA.