Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in regular-language

What is regularity?

computer-science regular-language

Generative regular expressions

regex regular-language generative-programming

Is a*b* regular?

regular-language computation-theory

How does "δ:Q×Σ→Q" read in the definition of a DFA (deterministic finite automaton)?

regular-language finite-automata dfa deterministic

Ignore everything in a directory except one subfolder

regex regular-language unison

substring match faster with regular expression?

regex string regular-language

Can a regular expression itself be parsed with a regular expression? [duplicate]

regex parsing regular-language

Which programming languages have a regular grammar?

programming-languages compiler-theory regular-language

Regular languages vs. non-regular ones [closed]

regex regular-language

Combining deterministic finite automata

regular-language automata deterministic

Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s

regular-language finite-automata computation-theory dfa

If we know a CFG only generates regular language, can we get the corresponding regular expression?

regex context-free-grammar regular-language

No \p{L} for JavaScript Regex ? Use Unicode in JS regex [duplicate]

javascript regex regular-language

What is the power of regular expressions?

regex regular-language

How should one proceed to prove (or find) if two regular expressions are same or equivalent?

regex finite-automata regular-language equivalence

To make sure: Pumping lemma for infinite regular languages only?

math finite-automata regular-language formal-languages pumping-lemma

An infinite language can't be regular? What is a finite language?

regular-language finite-automata formal-languages computability kleene-star

Minimum pumping length for the following regular languages

computer-science regular-language computation-theory compiler-theory

Is L = {a^n b^m | n>m} a regular or irregular language?

regular-language dfa formal-languages

Is there a way to negate a regular expression?

regex algorithm regular-language
« Newer Entries Older Entries »