Finite automaton deterministic about the alphabet (a-Z) that recognize the language ftp or ssh like prefix, cars or games like subword and com or net like sufix.
-
Updated
Apr 25, 2020 - C#
Finite automaton deterministic about the alphabet (a-Z) that recognize the language ftp or ssh like prefix, cars or games like subword and com or net like sufix.
Add a description, image, and links to the college-7th topic page so that developers can more easily learn about it.
To associate your repository with the college-7th topic, visit your repo's landing page and select "manage topics."