Develop Reference
c reactjs sql-server angularjs arrays wpf database batch-file google-app-engine silverlight
Home
About Us
Contact Us
dfa
How to design a DFA that accepts basic arithmetic expressions
NFA-lambda to DFA conversion
Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible
How to draw a DFA for that given language?
can a DFA have an arrow with empty string as input?
How should i draw these DFAs?
No. of DFA's that can be constructed
DFA for binary numbers that have a remainder of 1 when divided by 3
Why is this DFA not accepted?
I cannot seem to create a DFA for this language
How does the epsilon conversion work for NFA to DFA conversion?
Make DFA of the set of all strings from {0,1} whose tenth symbol from the right end is a 1
Construct a Deterministic Finite Automata (DFA) for the language 1*01 (11)*(0 U 1)*,
DFA of two simple languages and then product construction of those two languages
NFA to DFA where a state only has an epsilon transition
Convert this from NFA to DFA
Can a language have a multiple solution in dfa diagram?
DFA for all words that contain an even number of 0's and whose number of 1's is divisible by 3
Nondeterministic finite automaton & DFA
Show that the language is decidable
For each of the following regex, draw a DFA recognizing the corresponding language
Cross product of incomplete DFA's
Show that S is an arithmetic progression, then A can be recognize as a language
Subset construction of a DFA from NFA
analphabetic strings decidable by DFA?
DFA which accepts either even number of 1s or odd number of 0s. ex- 0,11,10,01,110,011,000,101 etc
How to create a DFA for min. one 0 and max. three 1’s
Construct a DFA of the language L = { L1 \ L2 }
Deterministic Finite Automata with 6 states
Are all final states reachable from the starting states of a DFA?
Can a DFA state have two arrows pointing to it with the same value?
Proving a language with a single string is regular.
Pseudocode for converting NFA to DFA
NFA to DFA conversion
How can I prove if this language is regular or not?
NFA to DFA conversion whose language is the complement of L(A)
DFA to PDA conversion
page:1 of 1 
main page
Categories
HOME
timer
active-directory
spring-aop
heap-memory
sonata-admin
rgb
azure-maps
drupal-7
sybase
permutation
prepared-statement
nagios
clearcase
nvda
azure-form-recognizer
akeneo
akka-stream
lldb
hotchocolate
visitor-pattern
datetime-format
cfhttp
jwe
clj-pdf
aircrack-ng
odk
cabal
vcr
aunit
lightbox2
inline
msxml
kdevelop
mapbox-api-staticimages
sites
packing
unix-text-processing
spotless
stack-machine
qpython
mongodb-shell
pico-8
alibaba-cloud-oss
dbix-class
laravel-upgrade
goroutine
multiple-inheritance
vue2leaflet
master-detail
ludwig
orbbec
pundit
uikeyboard
tomahawk
promisekit
armbian
auth0-lock
checked-exceptions
archilogic
sl4a
sony-lifelog-api
nuke
phpmd
git-fork
concrete5-5.7
x-tag
rup
libcouchbase
browser-link
inherited-resources
camanjs
mono.addins
django-1.7
razor-2
disjoint-union
osx-snow-leopard
nifty-gui
symfony-2.4
argumentexception
listitem
helicontech
filemerge
recess
enterprise-web-library
google-website-optimizer
ironjs
clients
certify
soappy
Resources
jquery
sql
iphone
html
c++
php
c#
java
python
javascript
r
node-js
ruby
ios
c
android
c#
java
python
javascript