regular-language

how to convert a DFA to a regular expression?

Proving concatenation of language is associative in Agda

Turing Machine for regular languages

Write a Regex which does NOT contain double letters anywhere (such as aa or bb,etc) Σ={a,b,c}

Closure under intersection of regular language

Context free and regular language with push-down automata and infinite elements

W(WR)* regular?

For regular language a*b*, is there a superset of it which is non-regular?

Proving nonregularity

How we can generate string from regular expression of type (L*+M*) * ?

Regular language closure under insertion

Can a Finite Automata exist without any final state?

How do these two discrete finite automata differ?

Context Free capable of generating all regular languages?

Infinite union of regular language

Find out which is a regular language

Proof a language is not regular using Pumping Lemma

Every regular language is finite | True or False?

How can I find the closure of a D FA

Finding error in proof stating the language L = {0^(n)1^(n) | n>0} is a regular expression

Start state for a DFA in Automata

Will L = {a*b*} be classified as a regular language?

How L={wxw^R| w, x belongs to {a,b}^+ } is a regular language

Regular Languages

Is any regular language L has infinite words?

prove that any language over 1 letter alphabet is regular

Need to construct DFA (deterministic finite automaton)

How does DFA minimization work?

how is it possible that the language a^n b^2n is regular if and only if it was finite such that 100 => n <= 0? [closed]

Proof that a regular expression is not a regular language using pumping lemma

How to remember NFA's choice on a certain computation?

RegEx for dynamic expression replacement

How to determine whether given language is regular or not(by just looking at the language)?

Theory of computation GATE 2012

If language L is not regular, is L* regular?

Minimum pumping length for a regular language

G is CFG, Is L(G) Regular

How can we distinguish between regular languages and context free languages?

Is the union of regular languages regular?

Using condition 3 of the pumping lemma to prove irregularity

over regular Languages L and D(L)

pumping lemma for very simple regular expression

Proof the language is regular or not regular using Pumping lemma?

Isn't every language regular, according to formal defination of it?

Why {a^nb^n | n>=1} is not a regular language?

How to check if a language is regular, context-free, det. context-free or type-0

Why is {a^n a^n | n >= 0} regular?

What is the Set defined by this Regular Expression?

Pumping lemma to show that `{a^n b^m | n=km for k in N}` is not regular

If pref(L) is regular, does that imply L is also regular?

Is this language regular? {0^n 1^m | m != n}, I don't understand the direct proof by pumping length

If L* is regular, then is L regular?

Regular language, L1 and L2

Is there any regular language that is not a context free language?

Automaton that recognizes a language without 3 consecutive zeros

Is This Language Regular or not?

Build a regular grammar for a regular language

design NFA which accepts specific length of strings

Finding the DFA

regular language pumping lemma for string with even 0's


page:1 of 2  next page   main page

Related Links

concatenation & union - regular and context free languages
The complement of the language L={a^n b^n | n !=100}
Is this language regular
Prove that a language is regular
How would you prove an ordered language is regular?
Are those two regular languages the same?
Show that the following set over {a,b} is regular
Regular Language to DFA conversion
RE: Odd length string over { 0, 1} that contains exactly two 0's [closed]
An infinite language can't be regular? What is a finite language?
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s
Is a*b* regular?
Tips to proof a language is not regular using Pumping Lemma
Cnnverting FSM to regular expression
Regular expression over a language - slight confusion [closed]
Regular expression over the following language

Categories

HOME
beautifulsoup
embedded
facebook-oauth
hyperlink
design-patterns
youtube-data-api-v3
hessian
fftw
knitr
dojo
big-o
pyqt4
jax-ws
elasticsearch-5
plist
opengl-es-3.0
onedrive-api
parameter-passing
esoteric-languages
dynamic-sql
scriptella
mount
siri
bulletphysics
handler
paperjs
subclass
uitapgesturerecognizer
userdefaults
github3.py
classcastexception
hibernate-search
batching
imx6
getlasterror
xdocreport
flatmap
ods
google-data-api
watchface
portforwarding
chronicle-map
http-request
contract
opencmis
phpdbg
video-conferencing
wpas
otp
check-mk
polyline
pure-css
reporting-services-2012
ziparchive
jboss-tools
installshield-2010
yajsw
jnlua
spring-retry
maybe
rewrite
jdi
ess
canvg
code-documentation
document-repository
showdialog
android-cookiemanager
appserver
encryption-asymmetric
unix-socket
personalization
vbe
xmltodict
scriptaculous
kendo-dataviz
alice
pdfviewer
extreme-programming
uimanageddocument
stress
landscape-portrait
fsevents
lr
pylucene
w3c-geolocation
mtu
nhprof
globals
web-application-project
tui
mathematical-notation
escrow
application-planning
firefox-3

Resources

Mobile Apps Dev
Database Users
javascript
java
csharp
php
android
MS Developer
developer works
python
ios
c
html
jquery
RDBMS discuss
Cloud Virtualization
Database Dev&Adm
javascript
java
csharp
php
python
android
jquery
ruby
ios
html
Mobile App
Mobile App
Mobile App