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

simplify regex, [star] mysteriously disappears

regex computer-science regular-language computation-theory

Can Lua patterns represent any regular language?

lua regular-language formal-languages

Regular expression for L = {w|w doesn't contain the substring 110} over the alphabet Σ = {0,1}

regex regular-language finite-automata

is a* the same as (a*)*?

algorithm regular-language

How to determine if a context-free grammar describes a regular language?

grammar context-free-grammar regular-language finite-automata formal-languages

Same regex but giving different result with StringTokenizer and Scanner class delimiter

java regex regular-language

Does order not matter in regular expressions?

regex computer-science regular-language automata

Regex only 14 numbers

regex regular-language

Will L={xww^R| w, x belongs to {0,1}^+ } is a regular language or not

automation regular-language

Which programming languages are regular? [closed]

regex language-agnostic programming-languages regular-language

Union of two (irregular) Context Free Language results a Regular Language?

regular-language formal-languages context-free-language

If L* is regular, then is L regular?

regular-language

Regex for at least one alphabet and shouldn't allow dot(.)

regex regex-negation regular-language

Why is the complement of a regular language still a regular language?

computer-science discrete-mathematics regular-language formal-languages

If every subset of a language L is regular then L is regular? [closed]

regular-language computation-theory

How is it possible to split a string by whitespaces, and also keep commas separate?

javascript regex split regular-language

Theory of Computation - Showing that a language is regular

computer-science finite-automata regular-language

How to implement regular expression assertions/lookaround (i.e. \b style word boundary) using a DFA regular expression matcher

java regex regular-language dfa word-boundary

Is there an efficient algorithm to decide whether the language accepted by one NFA is a superset of the language accepted by another?

algorithm computer-science finite-automata regular-language nfa
Older Entries »