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

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?

Categories

HOME
smarty
analysis
indesign
contact
imacros
modx-revolution
etl
windows-azure-storage
usergrid
circuit
clearcase-ucm
telephony
windows-7-x64
finite-automata
angular-ui
invantive-sql
interop
custom-wordpress-pages
zapier
scriptcs
sylius
chromium-embedded
wijmo
rundeck
sparse-matrix
cas
url-scheme
user-interaction
react-css-modules
fluentvalidation
replaceall
compatibility
delicious-api
flink-streaming
socialengine
ecto
google-sites-2016
pim
protovis
jmonkeyengine
dosbox
simplexml
streamsets
opshub
broadcastreceiver
android-tabhost
texmaker
midl
flashair
slick-3.0
galleria
windows-mobile-6.5
zendesk-app
linode
arrow-keys
spring-cache
dynamics-sl
mediaelement
abcpdf9
skobbler-maps
google-web-starter-kit
fputcsv
netmq
maven-tomcat-plugin
eclipse-clp
t4mvc
thredds
myo
dundas
pretty-print
c3
tt-news
php-5.4
openexr
funcunit
wp-query
system.net.webexception
transcoding
uv-mapping
ivyde
cdc
runtime.exec
opcache
buster.js
gwt-rpc
spring-validator
flashvars
mhtml
jspinclude
online-compilation
wse3.0
jquery-ui-layout
cufon
window-management
horizontal-accordion
lang
blitz++
icanhaz.js
webkit.net
iweb
lzh
document-conversion

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