Entwaesserung

Eintrag vom: 10.05.2013.

Use JFLAP to construct an nfa that accepts the language {C" : n is a multiple of 3 5 or 7} . The empty string is in this language since 0 is a multiple of every integer.

 

Question: (30 pt. 10 pt. each) Construct an NFA in JFLAP (version 7.1) that recognizes each of the following languages. For each language you must submit one JFLAP file clearly labeled (e.g. 2a.jff).

 

Note: You can change label names in JFLAP by clicking the arrow icon right-clicking (or ctrl-clicking) a state and selecting "Set Name". You can copy-paste this empty set character: ?.

 

Use JFLAP to create and test a DFA that accepts the language L= {a": n mod 4 = 3). Submit the DFA diagram and the JFLAP test results for the strings: a aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaaaaa.

 

Question: Use JFLAP to define a Grammar G such that L (G) = {w ? ?E* ?: n_a (w) ?greater than or eqaul to 2}.Examples: Expectation aba in L (G) ?aaa in L (G) ?bbababab in L (G) ?aabaabb in L (G) ? abbbaaaa in L (G) ?lamba not in L (G) ?bbb not in L (G) ?ba not in L (G) ?abb not in L (G) ?bbbab not in L (G)

 

Question: Use JFLAP to construct the DFAs and NFAs below. Test each machine using JFLAP Input Multiple Run. The alphabet for each problem is ? = {a b c} 1. Construct a DFA for L = all strings with a substring abb. Test Input: ccabbb abbabbc acbcbcabccabba ababacc bab abbabbab abcbb a b c 2. Construct an NFA for L = all strings with the substring abcba .

 

Use JFLAP to complete. Copy the tests into a txt file. For grammars use Input->Multiple Brute Force Parse. For PDAs use Input->Multiple Run. Also for PDAs do not push on multiple more than 2 items at a time. In the following screen select "Load Inputs" and select the txt file.

 

Run JFLAP by double-clicking on the JFLAP_Thin.jar file that you downloaded above. Then use File->Open to open the problem0.jff file that we have given you. In problem0.jff you will see the following FSM: This deterministic finite-state machine accepts all bit strings whose third bit from the left is a 1 and rejects all other bit strings. In other words the accepted bit strings must have at ...

 

Project description From JFLAP org website (from computer Science Department in Duke university) download JFLAP tool (JFLAP is software for experimenting with formal languages topics).

 

Question: Create an DFA in JFLAP that accepts L = { ?w in {0 1}*: w has at least one substring ?101? }. ?Use JFLAP to test the strings: 101; 00110111; 1000101110; 1100000110; 10101000100; 000101; 110101; \lambda Submit the JFLAP diagram for the DFA. Submit the JFLAP test case.