finite-automata

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

What is the english description for this DFA?

This NFA to DFA conversion is confusing me

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

Does jflap support (+) operator in a regular expression?

Definition of the “DFA for a language”

Give context-free grammars that generate the following language

Reducing a DFA to a NFA

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

Theoretical Approach for Deterministic Finite Automata

Regular Expression in Finite Automata

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

Definition of a language in Automata Theory

Designing DFA to accept language of even length beginning with 01

Optimization of Thompson Construction of an NFA

How can I tell from viewing the circuit if a machine is Moore machine or Mealy machine?

FA for a language which forms an AGP

how can i get weighted finite automaton?

which part of compiler is based on AT

From Recurrent Neural Networks (RNNs) to Finte State Automata (FSAs)

How to shift data in turing machine?

number of dfa's that can be designed

Binary division and DFA

what is the regular expression for the automaton?

Moore Machines with n states

how we can find regular expression for following strings

How can I prove this language is regular?

How to draw a DFA for given language?

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

Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L

Deterministic Finite State Automata for Modulo Comparison

DFA for integer in binary that is: 1mod5

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

Solve three letter string into regular expression way

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

Define strings and draw language

What is this DFA means?

Can I use stack in Turing Machine?

Why is this issue in the article impossible?

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

How to represent a coffee machine using DFA?

Performance characteristics of a non-minimal 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

Turing Machine support

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

What is a real life example of a Moore machine?

What are three dots in this DFA?

Can All States Be Final In A Deterministic Pushdown Automata?

Are there any steps or rules to draw a DFA?

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

Impossible Finite State Automata?

Difference between transition diagram and finite automata

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


page:1 of 2  next page   main page

Related Links

Minimum number of states in a DFA having '1' as the 5th symbol from right
What is the application of automata?
How to use the intersection construction to form a DFA?
Question about Finite State Automata
Equivalence between two automata
What are some specific applications of finite state automata? [closed]
Advantages/Disadvantages of NFA over DFA and vice versa
What is the typical alphabet size of Finite State Machines?
Is this DFA correct?
Minimum number of states needed?
Am I correct? (Finite Automata)
Finite state machines and deadlocks
Deterministic/non-deterministic state system mapping
Construct a DFA for the following language: all strings that have at least three 0s and at most two 1s
When you are proving a language is decidable, what are you effectively doing?
formal languages: what does R-trivial mean?

Categories

HOME
listview
server
json.net
appx
lodash
bookshelf.js
razor
windows-server
pivotal-cloud-foundry
echarts
uber-api
node-notifier
facebook-messenger-bot
elasticsearch-hadoop
gnupg
aurigma
oracle-coherence
crystal-reports-2008
viewport
textfield
paging
autosys
crystal-reports-2010
p-value
sparse-matrix
poltergeist
traffic
tooltipster
fopen
webkitspeechrecognition
gsoap
skia
lightswitch-2013
socialengine
.net-4.0
functor
noraui
pim
asset-pipeline
android-nestedscrollview
picasso
wixsharp
devextreme
serve
xcode-extension
mixture-model
webix-treetable
reportbuilder
reportingservices-2005
galleria
komodoedit
jedis
jquery-validate
svmlight
snmptrapd
static-ip-address
android-fonts
phishing
hexdump
energy
kendonumerictextbox
r-tree
teamcity-8.0
endeca-workbench
mutation-observers
wireshark-dissector
coveralls
muse
twirl
splash
event-bubbling
nsight
sortedlist
pretty-print
kineticjs
geonetwork
tween
ng-animate
codeigniter-url
android-imagebutton
cctv
heisenbug
funcunit
system.net.webexception
doskey
android-2.2-froyo
page-layout
.aspxauth
access-rights
runtime.exec
ftps
flash-builder4.5
cos
buster.js
back-stack
jelly
factory-method
simba
libstdc++
getmessage
gnu-prolog
window-management
infobox
inotifycollectionchanged
lang
blitz++
gamequery
gamma
private-members
wsdl.exe

Resources

Mobile Apps Dev
Database Users
javascript
java
csharp
php
android
MS Developer
developer works
python
ios
c
html
jquery
RDBMS discuss
Cloud Virtualization
Database Dev&Adm
javascript
java
csharp
php
python
android
jquery
ruby
ios
html
Mobile App
Mobile App
Mobile App