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

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
Checking if a Language is Regular

Categories

HOME
adal
powerpoint
apiblueprint
vscode-extensions
google-cloud-functions
newrelic
pyqt4
x264
mvc5
elasticsearch-5
jquery-ui-sortable
minecraft-forge
dkim
endpoint
enterprise-architect
http-post
package-managers
symfony-2.8
feathersjs
foreign-keys
sse
delphi-xe5
googlebot
visual-glitch
react-toolbox
string-concatenation
php-mysqlidb
aggregation
monit
handler
custom-controls
userdefaults
mockjax
glib
autolisp
clickjacking
biztalk-rule-engine
protege4
docfx
sql-server-ce
google-earth-engine
timing
protein-database
cin
kill
preloader
berkeley-db-je
fclose
identification
tf
openblas
backbone-collections
excel-dna
jqchart
flac
juice-ui
taocp
visual-studio-2008-sp1
reporting-services-2012
centrifuge
nikeplus-api
i386
expectations
delta
respondcms
refinerycms
freepbx
php-socket
spreadjs
fuzzywuzzy
beanstalk
pushbots
blitline
jbase
gocql
file-move
dock
pax-exam
mod-proxy
typemock
sql-server-data-tools
zxspectrum
variadic-templates
cocos3d
angular-carousel
named-parameters
codeplex
matrix-inverse
inputmismatchexception
isqlquery
hidapi
virtual-pc
joomla3.1
qtconcurrent
josql
lambdaj
android-holo-everywhere
tournament
metaweblog
jqueryform
aspmenu
tui
wordprocessingml

Resources

Encrypt Message