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

New posts in dfa

Construct DFA for L = {(na(w)-nb(w)) mod 3>0}

automata finite-automata dfa

Confused on a basic operation of regular expressions

regex dfa nfa

DFA minimization

regex lexer dfa nfa

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

NFA DFA and Regex to Transition Table [closed]

regex dfa nfa

How to find the intersection of two NFA

algorithm intersection finite-automata dfa nfa

drawing minmal DFA for the given regular expression

regular-language dfa nfa

Data structure to represent automata

haskell data-structures dfa

Why L={wxw^R| w, x belongs to {a,b}^+ } is a regular language

automation regular-language dfa nfa pumping-lemma

time complexity trade offs of nfa vs dfa

compiler-construction time time-complexity dfa nfa

How can I simplify token prediction DFA?

java antlr antlr3 lexer dfa

Why is E(dfa) a decidable language?

language-agnostic programming-languages dfa turing-machines decidable

Pumping lemma for regular language

regular-language dfa computation-theory pumping-lemma

can the compiler feasibly calculate a DFA from a regular expression?

c++ regex c++11 template-meta-programming dfa

Minimize a DFA with don't care transitions

algorithm language-agnostic dfa

How do you write a lexer parser where identifiers may begin with keywords?

parsing keyword lexer dfa

Recursive generic definitions and Stackoverflow in Java

java generics stack-overflow dfa

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

regular-language finite-automata dfa deterministic

Regular expression that generates a DFA with dead or superfluous states

regex dfa nfa

How to convert a DFA to a Turing machine?

theory dfa turing-machines
Older Entries »