Skip to content

Design a NFA to accept words composed by the letters in "HIDALGO", in any order, with a maximum of: two A's, one D, and one L. It can have any number of H's, I's, G's and, O's.

License

Notifications You must be signed in to change notification settings

Jeffresh/NFA-HIDALGO

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Non Deterministic finitic automata: HIDALGO

A program that counts from an input text all words composed by letters in "HIDALGO", with a maximum of two A's, one D, and one L, and any number of the other letters. Implemented using the table method.

The text to be used as an input is "El Quijote", which is provided.

About

Design a NFA to accept words composed by the letters in "HIDALGO", in any order, with a maximum of: two A's, one D, and one L. It can have any number of H's, I's, G's and, O's.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published