finite-automata

finite-automata

Performance characteristics of a non-minimal DFA

How to represent a coffee machine using DFA?

Does there exist a TM for all countable languages?

In this minimal perfect hashing function, what is meant by FirstLetter and Predecessor?

Finite State Automata Diagrams

Need an example of a DFA with large number of states?

How can I make a string empty again after going through different states in a non deterministic finite automata?

Turing Machine support

What are three dots in this DFA?

Are there any steps or rules to draw a DFA?

Impossible Finite State Automata?

Difference between transition diagram and finite automata

Algorithm which decides whether L(M) = {a} or L(M) =/= {a}

Automata theory : Conversion of a Context free grammar to a DFA

Turing machine that accepts strings with an equal beginning and end length

Finite Automata Definition of language

Can final and non-final states having identical configurations be merged together in a minimal DFA?

automata theorem: existance of a DFA [closed]

Simulating regular expressions with deterministic finite automata and the size of the alphabet

How to take intersection of two Finite Autometas

DFA minimization algorithm understanding

Turing Machines

Embed user action after processing every character in Ragel

Is null string allowed for w, if "w ∈ {a, b}*"?

Can a DFA have epsilon/lambda transitions?

How to solve δ(A,01) for this DFA?

Whether a given context-free language is regular

Union-ing two DFA's using Product Construction with the Error State

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

How can I construct finite automata

FSM framework required

Is there a relation between DFA and Loop, NFA and recursion?

Is this language regular?

Finite automata, Pushdown automata and Turing machine examples

Arcade Fighting Game AI

how to correct a slightly incorrect DFA, for a given correct input string?

DFA and NFA equivalent language

Is Dead state is included in the Minimized DFA or not?

Application of Brzozowski Algebraic Method on this FA

Minimum number of states in a DFA having '1' as the 5th symbol from right

A square root computing turing machine [closed]

JFLAP : Symbol for any character in lanugage

How to use the intersection construction to form a DFA?

How to determine if my NFA is correct?

What is the application of automata?

nondeterministic finite automation question

Question about Finite State Automata

Equivalence between two automata

Advantages/Disadvantages of NFA over DFA and vice versa

What is the typical alphabet size of Finite State Machines?

Am I correct? (Finite Automata)

Minimum number of states needed?

Finite state machines and deadlocks

Deterministic/non-deterministic state system mapping

When you are proving a language is decidable, what are you effectively doing?

Construct a DFA for the following language: all strings that have at least three 0s and at most two 1s

Visualize a XML defined finite state machine

Determinant Finite Automata (JFLAP)

Lex and Yacc for Finite Automata

NFA to DFA Algorithm

page:2 of 3 prev page next page main page

Categories

ruby-on-rails-5

azure-devops-migration...

redux-observable

description-logic

flutter-platform-channel

uiaccessibility

rounded-corners

android-studio-arctic-fox

seven-segment-display

azure-lab-services

ibm-data-replication

react-native-animatable

boost-multi-index

applicationcontext

angular4-router

digital-assets-links

angular2-webpack-starter

accelerate-framework

oracle-bpm-suite

thinktecture-ident-server

stacked-area-chart

backtrack-linux

teamstudio-unplugged

mvvm-foundation

memory-footprint

Resources