Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in finite-automata

Understanding (and forming) the regular expression of this finite automaton

What is the application of automata?

finite-automata

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

what is the McNaughton-Yamada Algorithm?

How do regex engines account for irregularity?

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

Can I implement State Transitions for a DFA in Java using java.util.Set

Superscript plus sign meaning

What is the most efficient way to create a lexer?

Design DFA accepting decimal strings divisible by 7

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

Theory of Computation - Showing that a language is regular

How the Perl regular expressions dialect/implementation is called?

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

(FInite State Machine) - Implementing a XML schema validator in javascript

How to merge two finite state automata?

Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?

How to find the intersection of two NFA

how to draw automata in java

Testing intersection of two regular languages