I know how to apply Kleene star on language but I'm not sure how would I apply it to DFA or NFA. I'm pretty sure it would need to be epsilon NFA with ...
I know how to apply Kleene star on language but I'm not sure how would I apply it to DFA or NFA. I'm pretty sure it would need to be epsilon NFA with ...
Every example I had seen with Kleene star operations over languages show the expansion in order so I was wondering, does Kleene star operation require ...
What would be the highest number of states a DFA would have for a language L*? Is it possible to define a worst-case scenario here? ...
I have some working code for getting all the ancestors of a term in a hierarchy. Following: It breaks when an IRI's broader predicate is a subprope ...
Say we have two languages L1 and L2, is the following condition below considered false? I'm assuming this because say: Leftside of condition: R ...
Note: Not sure if this is the correct site for this question. I found other finite-autometa theory questions here, so posting here. Suppose a langua ...
Does the regular expression X•(Y*+Z) accept the word X? I would say it does, as Y=ε should fulfill the disjunction, but I'm not sure. ...
Most sources, such as http://www.cs.may.ie/staff/jpower/Courses/Previous/parsing/node5.html, suggest that the Kleene closure be constructed with 4 nod ...
What is the difference between the following regular expressions? (a U b)* and (ab)* Difference between union and concatenation ? which of the above ...
It makes sense to assume that L* is not regular. However, I cannot find a proof of either conclusion. ...
I have been trying to prove that two regex are equivalent. I know that two regex are equivalent if they define the same language. But i am not getting ...
I'm reading a paper about programming languages engineering and compilers (6.035 Fall 2005 MIT course). The following page should explain the working ...
I am currently taking a course of Theory of Automata and i came up with following problems. I came up with the answer of 1st one but confused about th ...
I'm looking for references that give an algorithm to solve this problem: Problem: Given a finite alphabet Σ and a finite language L ⊆ Σ* , determine ...
For the given context free grammar: How do I rewrite the grammar so that it is LR(1)? The current grammar has shift/reduce conflicts when parsing ...
Let n be any terminal. Consider the following, presumably correct, representation of the kleene star over n: (where ε is the empty terminal.) Wik ...
Let G = (V,E,r) a rooted directed graph, defined by a set of vertices V and a set of edges E with a designated root node r. The graph may contain cycl ...
I'm trying to create the context free grammar which generates all regular expressions over {a,b} with at least one Kleene star. What I've done so far ...
Let L = {an | n >= 0}, where and for all n >= 1. Thus L consists of sequences of a of all lengths, including a sequence of length 0. Let L2 b ...
I'm doing this for homework. I need to write a regular expression for a language over (a, b) that includes all strings not included in a language (a*b ...