z-logo
open-access-imgOpen Access
Simplifying Designing Techniques: To Design DFA that Accept Strings over ?={ a, b} Having at least x Number of a and y Number of b
Author(s) -
Danish Ather,
Raghuraj Singh,
Vinodani Katiyar
Publication year - 2014
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/15891-4841
Subject(s) - computer science , symbol (formal) , deterministic finite automaton , computation , automaton , theoretical computer science , face (sociological concept) , arithmetic , algorithm , discrete mathematics , mathematics , programming language , social science , sociology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom