I've attached what I have. My problem is that I don't know if its correct and if I've even used the fewest states possible to answer this question. Really appreciate any help on what I currently did wrong this is what i have currently
Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible
245 Views Asked by theworkforceof At
1
There are 1 best solutions below
Related Questions in DFA
- how to handle Unicode dot in table driven FSM?
- i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b
- How to design a regex used for searching a pattern, rather than validating a pattern?
- Difference Between KMP and Regex/DFA-based Searching
- Deterministic Finite State Automaton (DFA) Exam Q
- Converting DFA to RE
- Deterministic Finite Automata with 6 states
- Create Syntax tree from given Regular Expressions (For RE to DFA)
- If pref(L) is regular, does that imply L is also regular?
- Suggestions to implement a DFA to classify binary strings with a genetic algorithms strategy
- Python: Converting a list of sets to a set
- Can final and non-final states having identical configurations be merged together in a minimal DFA?
- Regex Matching a string
- How to convert a DFA to a Turing machine?
- how to intuitively think while Designing an NFA
Related Questions in LINGUISTICS
- semantics of verb-attached preposition phrases Prolog
- Any (rough) equivalent to iOS NSLinguisticTagger for android?
- How to linguistically parse English Text?
- Natural language summary based on two properties
- translation doesn't work when executing application
- Transliteration between different writing systems
- feed class from list
- How do I install "Ruby Linguistics With Verb Conjugation"?
- English Language Dictionary api
- Looking up a word's sentences in a corpus of 15 million words
- stanford corenlp not working
- Extracting verb from german sentenceces
- Where is the same error coming from, LMER test?
- Selecting the most fluent text from a set of possibilities via grammar checking (Python)
- How to build short sentences with a small letter set restriction?
Related Questions in FINITE-STATE-AUTOMATON
- 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'
- Given a finite character vocabulary, what is the easiest way to represent arbitrarily long sequences of characters with uniform length?
- How to create a deterministic finite automata for the "regular" function where states lead to more than one state depending on the value of an int
- How do I set a pause between if statements?
- Detect cyclic feeding interactions without applying XFST replace rules to lexicon
- Understanding Lexicon FST in yesno example of Kaldi
- How does placing the output (word) labels on the initial transitions of the words in an FST lead to effective composition?
- How does forced alignment happen in Kaldi?
- On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition
- Finite state machine with timer resets
- how to construct a dfa that recognizes the set of bit string that begins with two D's?
- Automaton for prefix matching
- Why does my screen not update when I click my button the first time, but works perfectly fine afterwards?
- Generate output based on first character of a word
- Is this NFA correctly accepting inputs that end with a 00?
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?
I would start by creating two FSAs, one for each of the branches.
For
A*you only need one state.For
AB+you need three states.Then you merge the two. Assuming it does not have to be deterministic, the total FSA ends up with three states as well, two of which are final states.
As you tagged your question
dfa— a deterministic FSA would need 4 states in total:Start state: 1; Final States: 1,2,3,4
Transitions:
1 - a -> 2
2 - a -> 4
2 - b -> 3
3 - b -> 3
4 - a -> 4
That is a DFA that recognises (a*|ab+):