Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nahumfarchi
on Nov 14, 2024
|
parent
|
context
|
favorite
| on:
Interview with gwern
Yes, all finite languages are regular.
Specifically, you can construct a finite automata to represent it.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Specifically, you can construct a finite automata to represent it.