regular-language

regular-language

deriving a regular expression for a language

Using string of set length with pumping lemma to prove irregularity

Let L be a language over {a,b} that contains the same number of occurrences of a and b. Which of the following language is regular?

Why this regular expression (\d{n,m})* does not work as expected?

Hi. I have a question.( na(w)_nb(w)) mod3=1 . I have tried alot of ways but I coudn't solve it.I wanted to write regular language

How can I remove the last symbol of a DFA

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

Draw NFA for regular language

Build regular expression

Is L = {ww^Ru | w, u ∈ {0,1}+} regular language?

Regular language demonstration

Operating on a Regular Expression before applying Pumping Lemma

Show is not regular with pumping lemma

Why do we use pumping lemma to prove the non-regularity of languages? WHY? [closed]

If L and L complement are Recursively enumerable then why can't L be a Regular language?

automate and formal laguages - prove that language is regular

Is this a valid regular language expression for a binary string? Can it be condensed into something more concise?

Regular or context-free or other

Use the pumping lemma to show that the following languages are not regular languages L = {anbm | n = 2m}

L={a^i b^j c^k d^l | i=k and j=l} i couldn't find the grammar of the given language

how to prove an arbitrary language can be accepted by an Infinite state automata

Annihilator set in regular expression

infinite regular language and finite regular language proof

How to Pumping lemma for Regular language

Inserting a regular language into other regular language

Removing white spaces between numbers using regex in abinitio if length is 9 by excluding spaces

Convert DFA to RE

Minimum pumping length of L= {0^i1^j | i >= j} to prove L is non regular

Minimum pumping length of a regular language

How do you interpret it? (u∈Σ∗)

Regular Expressions and languages of alphabets with substring

why is l { xy | x,y in {a, b}* ,where |x| = |y| } regular? Supposedly it is just even length strings?

Prove regular language and automata

Construct a CFG for Regular Expression

Is L = {wxw| x, w ∈ {a,b}*} a Regular Language?

How to match the given pattern in the given String using only Regular expression

Using the pumping lemma to prove irregularity in a regular language - where is the error

Definition of regular languages using fsm

Prove that the following language is regular:

If the string of L consists of 0's only prove that L* is regular

PDA and a regular expression

Given two DFA's, how can I check that the language generated by the first DFA is included in the one generated by the second one?

Write the regular expression that describes the set

Automata to regular expression

Showing that the intersection of two language accepted by NFA is undecidable

Regular Expression of given Automata

Is this proof with the pumping lemma (no regular language) ok?

Regular expression over the language C={a,b}

NFA to accept set of all binary strings with 2, 5, 8, 11,... number of 1s

REGULAR language (Automata theory)

Is the RE and the finite automata same?

how do I show a regular language is equal to another?

how can pass this regular expression in C# ?about"[]" mean

Show zeroes in a Regular Expression decimal

Pumping Lemma for Regular Languages for a language that includes a constant

Regular expressions for strings not containing specific substring

Context free language (Pumping lemma a^n b^m c^min(n,m))

Regular Expression with if Condition and if then else condition

1 or 2 right hand side variable in Context free language

Regular expression to form words with exactly 4 a's or 5 b's

page:1 of 3 next page main page

Categories

angular-services

woocommerce-subscriptions

telecommunication

aws-parameter-store

diameter-protocol

flutter-renderflex-error

phonegap-plugins

sms-verification

google-eclipse-plugin

antivirus-integration

iiviewdeckcontroller

Resources