Skip to main content

Question list filters

Filter by
Sorted by
Tagged with
Score of 0
0 answers
25 views

(cd+)+? I have cd+ to {cd, cdd, cddd, ...} but I do not understand how to apply the + from the parenthesis. I saw that if it is like (d*)* then it is same as d* but here its not just d* in it but c ...
Score of 2
1 answer
2974 views

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 initial state that is final and final states might ...
Score of 0
1 answer
318 views

Every example I had seen with Kleene star operations over languages show the expansion in order so I was wondering, does Kleene star operation requires ordering in the language? For example, given the ...
Score of 0
1 answer
375 views

I need to find all email addresses with an arbitrary number of alphanumeric words, separated through a period. To test the regex, I'm using the website https://regex101.com/. The structure of a valid ...
Score of 0
1 answer
1163 views

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?
Score of 0
1 answer
740 views

I want to pass only the strings like this: abc* 123* abc 123* abc-123abc* I don't want to pass strings like those: - abc** - abc*123 - *abc The asterisk must be in the end and only once time. ...
Score of 0
0 answers
438 views

For any user input string A ,with at least one instance of the star operator *,verify that input string B can be produced by A. For example: go*s can produce the strings goes,goners,goals etc. I can't ...
Score of 1
2 answers
334 views

I have some working code for getting all the ancestors of a term in a hierarchy. Following: PREFIX skos: <http://www.w3.org/2004/02/skos/core#> PREFIX skos-xl: <http://www.w3.org/...
Score of 0
1 answer
158 views

Say we have two languages L1 and L2, is the following condition below considered false? (L1L2)* = L1*L2* I'm assuming this because say: Leftside of condition: L1 = {a,b} L2 = {c,d} C = L1.L2 C = {...
Score of 0
2 answers
638 views

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 language is defined over two letters L1 = { aa , b } ...
Score of 1
2 answers
70 views

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.
Score of 1
0 answers
469 views

How can I implement the Kleene star operator to determine the Kleene closure up to a specific level?
Score of 6
1 answer
1308 views

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 nodes. Why can't it be constructed with just 2, as ...
Score of 5
2 answers
9220 views

I read that every Non-deterministic Finite Automaton (NFA) can be transferred into a Deterministic Finite Automaton (DFA). Can this be done for kleene star regex, say a*? Above is the NFA for a*.
Score of 10
1 answer
15371 views

What is the difference between the following regular expressions? (a U b)* and (ab)* Difference between union and concatenation ? which of the above regex accepts strings in which 'a' is always ...

15 30 50 per page