Skip to content
/ DFA Public

A Swift Playground Book that teaches the concept of a deterministic finit automaton.

License

Notifications You must be signed in to change notification settings

leoMehlig/DFA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Deterministic Finite Automaton

A Deterministic Finite Automaton (short DFA) is a finite state machine, that checks if a string of characters follows certain rules. It's bascally another way to represent a Regular Expression, but just have a look at the Swift Playground Book if you want to learn more.

Screenshot

How to get the Playground Book

My WWDC19 Scholarship Application

I built this Playground Book in a few days as part of my WWDC19 Scholarship Application and luckily got accepted!

About

A Swift Playground Book that teaches the concept of a deterministic finit automaton.

Resources

License

Stars

Watchers

Forks

Packages

No packages published