This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[ | |
{ | |
"tags": [ | |
"Japanese restaurants", | |
"Restaurant", | |
"Sushi", | |
"Bar", | |
"Food", | |
"Food & drink", | |
"Japanese restaurant" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[ | |
{ | |
"tags": [ | |
"Others", | |
"Tech startups", | |
"Homes", | |
"Offices", | |
"Corporate office", | |
"Work", | |
"Services", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Arguments are the parameters of a deterministic finite automaton: | |
q -- states (list of strings) | |
si -- input alphabet (list of characters) | |
de -- transition function ((index of q),(index of si) --> (index of q)) | |
s -- start state (index of q) | |
f -- accept states (list of (index of q)) | |
Returns a generator function which takes a string and generates successive | |
states (indices of q) as the DFA runs on the string. | |
""" |
NewerOlder