Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with regular-languages
Search options not deleted
user 10314
Questions about properties of the class of regular languages and individual languages.
4
votes
3
answers
161
views
Was there an attempt to make reusable regular expressions?
In everyday practice I often encounter tasks which would benefit from being able to define aliases for chunks of regular expressions to reuse them later. Typical examples include: parsing a floating p …
- 1,388
1
vote
0
answers
332
views
Language of rationals is regular, what is the number set equivalent to PDA?
Consider rational numbers given as their decimal expansions, then for every number we can build a finite automaton able to accept it. To simplify the argument, assume that finite rational expansions …
- 1,388
5
votes
1
answer
162
views
Algorithm to find a minimal regular language containing given context-free language
I am not sure that the problem is in general solvable, but here's an example of what I mean:
Any context-free language has a trivial regular language that contains it: $\Sigma^*$.
The language $L_1=\ …
- 1,388
3
votes
1
answer
541
views
Star-free decomposition of regular language given by regular expression
I was wondering: is there an algorithm to decompose any regular expression, provided it doesn't use complementation, into one or more regular expressions which don't use Kleene star (only catenation a …
- 1,388
2
votes
2
answers
116
views
Arden's rule expressed as matrix algebra
The following theorem is (in the context of languages) known as
Arden's Lemma: Given a linear system $X = B+AX$ and the matrix A is
quasiregular, then we have a solution which is unique and whi …
- 1,388
5
votes
1
answer
206
views
What can be said in general about a homomorphism between two regular languages?
In other words: is a homomorphism always guaranteed to exist between two arbitrary regular languages? If not (which I suspect), are there only a finite number of classes of languages, for which we can …
- 1,388
4
votes
1
answer
4k
views
Given regular expression construct regex for the complement language
Disclamer: this is my uni assignment, which is rated comparatively low, thus I assume that the answer should be simple. Hints are appreciated (as opposed to direct answers).
Write an algorithm wh …
- 1,388