finite-automata

finite-automata

How to design a DFA for given language? [closed]

Is it possible to have more than one minimal DFA 's for a regular language?

Which one of these grammars (if not both) is appropriate for the following context-free language?

L_mult={a^i b^ij c^j:i,j≥0}, what would be the graph of diagram machine

How to deal with epsilon transitions while converting NFA to DFA?

Is this DFA has already been minimized?

DFA that contains 1011 as a substring

In determinstic finite automata is there any possibility that every state is final state? [closed]

Using alpabet in automata

Enter a description of the language accepted by following Deterministic Finite Automata

How to find the language of a NFA

Design a FA to accept L, where L = Strings in which ‘a’ always appears tripled

Removing or adding the empty word from a DFA

I need to create a finite automata

Non Deterministic Finite Automata acceptance and Rejection

How to convert a regular grammar to finite automaton?

Deterministic Finite Automata on JFLAP

If a DFA is minimized, is it guaranteed that it's complement is also minimized?

DFA for strings not containing 101101 as substring

How to define accepting states in a finite automation?

Finite Automata string not ending with ba

Finite State Machine procedure

Language finite automata difference

DFA for (0001)*, is it correct

Is this correct NFA graph?

Prove the language is not context-free?

Drawing a DFA for L= { a^n b^n , n>0}

Is this correct by ardens lemma?

Construct nfa occuring strings over {0,1} such that some two 0's are seperated by a string of length 4i, i>=0

Let A,B, C be fad. Consider the equation X = AX + BX + C. Must a solution X be fad?

Pair of Zeros separated by 1's NFA?

How to draw the FA or NFA of b*(ab)*a* [closed]

Creating a automata where the length of the 0's in the automata are odd

Can {a,b,c}*a^n{a,b,c}*b^n{a,b,c}*c^n{a,b,c} be accepted by an FSA?

What is the english description for this DFA?

This NFA to DFA conversion is confusing me

Let Σ={a,b,c}. How many languages over Σ are there such that each string in the language has length 2 or less?

Definition of the "DFA for a language"

Give context-free grammars that generate the following language

Is it possible for a DFA to change its state to a new state without accepting any input symbol

Regular Expression in Finite Automata

Designing DFA to accept language of even length beginning with 11 [closed]

how can i get weighted finite automaton?

How to shift data in turing machine?

how we can find regular expression for following strings

Binary division and DFA

Moore Machines with n states

what is the regular expression for the automaton?

How can I prove this language is regular?

Is it possible to determine the number of states in a minimal DFA without explicitly constructing it?

How to determine the number of states of finite automata according to any language?

DFA for integer in binary that is: 1mod5

Deterministic Finite State Automata for Modulo Comparison

i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b

Can I use stack in Turing Machine?

Solve three letter string into regular expression way

What is the difference between an Alphabet and an element of a set?

Finding the smallest DFA that separates two words without using brute force search?

What is this DFA means?

How to determine whether finite-state automata is deterministic?

page:1 of 3 next page main page

Categories

ssl-certificate

language-comparisons

skype-for-business

space-complexity

database-project

amazon-workdocs

servlet-filters

hidden-markov-models

agora-web-sdk-ng

pre-trained-model

markerclusterer

nstableviewcell

angularjs-routing

django-comments

reverse-debugging

rational-performance-test

Resources