regular-language

regular-language

Relation of pumping lengths between related regular languages

How many languages does a DFA recognize?

running Discrete wavelet transform in R Language

Regular expression in Automata Theory?

How to determine which language is simpler

how to convert a DFA to a regular expression?

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

Proving concatenation of language is associative in Agda

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

Proving nonregularity

Can a Finite Automata exist without any final state?

How do these two discrete finite automata differ?

Find out which is a regular language

Infinite union of regular language

Proof a language is not regular using Pumping Lemma

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

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

Start state for a DFA in Automata

Is any regular language L has infinite words?

prove that any language over 1 letter alphabet is regular

Regular Languages

Need to construct DFA (deterministic finite automaton)

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

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

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

Regular pumping lemma proving L={Am+n Bm C2n} is not regular

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

G is CFG, Is L(G) Regular

Minimum pumping length for a regular language

Is the union of regular languages regular?

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

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

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

What is the Set defined by this Regular Expression?

pumping lemma for very simple regular expression

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

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?

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

Automaton that recognizes a language without 3 consecutive zeros

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 This Language Regular or not?

design NFA which accepts specific length of strings

Build a regular grammar for a regular language

Finding the DFA

DFA without final state

Regular expression with quantity dependence

Struggling to understand Myhill-Nerode

concatenation & union - regular and context free languages

Is this the correct way to use the pumping lemma?

Wonder is the following language finite

The complement of the language L={a^n b^n | n !=100}

Finiteness of Regular Language

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

page:2 of 3 prev page next page main page

Categories

shared-libraries

google-maps-api-2

azure-hdinsight

mini-css-extract-plugin

react-chartjs-2

sql-server-2016-localdb

sql-server-agent

paceautomationframework

azure-integration-runtime

amazon-dynamodb-local

phonegap-plugins

android-audiomanager

hyperledger-explorer

androidappsonchromeos

textmatebundles

generator-expression

geometrydrawing

jqueryi-ui-buttonset

floating-point-exceptions

recent-documents

linq-to-nhibernate

hardware-infrastructure

Resources