python (65.1k questions)

javascript (44.2k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (12.9k questions)

Questions - regular-language

why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular language

a^m b^n where m,n >= 0 is a regular language but why a^n b^n where n >= 0 is a non-regular language? In both languages, we are taking an infinite number of a's and b's but why we could build a F...
test-img

Priyansh Srivastava

regex

regular-language

computation-theory

finite-automata

Votes: 0

Answers: 3

Latest Answer

Let us consider the above languages as A,B: X = a^m b^n where m,n>0 Y = a^n b^n where n>0 Language X is a regular language but Language Y is not a regular language because we cannot construct...
test-img

Sri Harika

Cannot seem to regexp extract a word on URL (Data Studio)

I read from somewhere that Datastudio use little bit different Regular Expression from other places: that it uses RE2. I, however, manage to find a site to test for RE2 regex and able to get it runnin...
test-img

FastBoi

regex

looker-studio

regular-language

Votes: 0

Answers: 1

Latest Answer

You can use several solutions here. Solution 1: matching digits after a specific string (here, news-) (news-[0-9]+) See the regex demo, [0-9]+ matches one or more digits. Solution 2: If there can be ...
test-img

Wiktor Stribiżew

Draw NFA for regular language

Here I found a example for a regular language. L = { a^n | n>=2 } is regular. Clearly, we can draw a finite automaton with 3 states. I was asking myself how this graph would look like. If I choos...
test-img

Johnny

regular-language

finite-automata

Votes: 0

Answers: 2

Latest Answer

given language is L = { a^n | n>=2 }. here the minimum number of a's is 2, so the finite automata contains 3 states(2+1) =>(q0,a)->(q1,a)->(qf,a*). Similarly if the minimum number of a's ...
test-img

Vyshnavi Koppisetty

Javascript Capitalize first letter of each word ignore Contractions

I am trying to Capitalize the first letter of each word in a string. I found similar questions online but none seem to answer my question of ignoring Contractions like can't, won't, wasn't. This snipp...
test-img

Shayne

javascript

regex

string

regular-language

capitalize

Votes: 0

Answers: 3

Latest Answer

You can use const texts = ["this_can't_be_an_example", 'this/is/an/example', 'this,is,an,example'] for (const text of texts) { console.log(text, '=>', text.replace(/([\W_]|^)(\w)(?<!\w'\w)...
test-img

Wiktor Stribiżew

Posts

Questions

Blogs

Jobs