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 answers
Related Questions in DFA
- Theory of Comp Sci - State Diagrams NFAs
- Converting ENFA To DFA and ENFA NFA
- Theory of computer science problems
- a challenging finite automata - what is the language?
- Correct labeling for this regular language?
- State diagram of DFA with 5 states
- How to get automatically token for dfa every 7 days
- Finite state automata minimization
- DFA for all binary strings having even number of 0's or contains exactly two 1's
- Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b
- Intersection of two Deterministic Finite Automata (DFA)
- Assembly Code Segmentation Error While Making DFA state machine
- Deterministic finite-state automaton in x86 Assembly (GCC)
- Construct DFA that accept binary string having odd number of 1’s or even number of 0’s
- What strings are accepted by the pattern "^[ab]?|c?$"?
Related Questions in LINGUISTICS
- Likert scale study - ordinal regression model
- Automatic Word Boundary Detection for German
- Can log2 be substituted with ln in logDice association measure in R?
- Using numeric column in dataframe within formula in R
- Query Wikidata via SPARQL to get specific word etymology from Wiktionary
- What does "assign A to B" mean?
- Problems with reproducing the training of the spaCy pipeline
- In NLTK, how to generate a sample of sentences from PCFG, respecting the probabilities
- LLM Content Generation in Non-English Languages
- In R, is it possible to create a random list of words for a speech stream (exposure) where I give it the syllable triplets I need (psycholinguistics)?
- Weighted Distance Matrix for QWERTZ Keyboard for Levenshtein Distance Algorithm
- How to develop a corpus(corpus analysis)
- How do I study linguistic features of NLP libraries like spacy/NLTK in-depth?
- Tool for detecting differences between text passages from two different groups
- R - readtext and list of .xml files
Related Questions in FINITE-STATE-AUTOMATON
- How does the record assembly work in dremel?
- How to create a singleton in Python that always replaces the previous instance?
- Finite state machine with timer resets
- Understanding Lexicon FST in yesno example of Kaldi
- How does forced alignment happen in Kaldi?
- On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition
- How does placing the output (word) labels on the initial transitions of the words in an FST lead to effective composition?
- 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 to simplify/generalize a Finite State Machine (FSM) for a vending machine?
- Aligning nodes in dot with group does not give the desired result
- How do I set a pause between if statements?
- Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible
- Detect cyclic feeding interactions without applying XFST replace rules to lexicon
- Generate output based on first character of a word
- Given a finite character vocabulary, what is the easiest way to represent arbitrarily long sequences of characters with uniform length?
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?
Popular Tags
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)
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+):