HTTP/1.1 200 OK Date: Sat, 17 Jan 2026 13:37:22 GMT Server: Apache/2.4.41 (Ubuntu) Last-Modified: Wed, 06 Aug 2025 15:31:46 GMT ETag: "358d-63bb409e1858e-gzip" Accept-Ranges: bytes Vary: Accept-Encoding Content-Encoding: gzip Content-Length: 3673 Content-Type: text/html

Content-Type: text/shitpost

Mark Dominus (陶敏修) mjd@plover.com RSS Atom I have another blog that doesn't suck. 25 recent entries Bulk liquid food transport Sister cities? Frequently asked questions about signal handling in C The silliest town name in the United States Don't get all up in my grill Jehovah's Witnesses schism More pizza heresy Followup to a Stack Exchange comment from 2014 Actors with odd names Is this a coincidence? Thing I believe About that aphorism Potamus Dark side of the Moon How to tell apart the languages of Nigeria? Carl Gauß' hat Well-ordering blah The Sun's Wish Passing thought Sisters Skinks Modok Croatian puzzle I have had this conversation more than once Archive: 2023 JF 2022: JFMAMJ   JASOND 2021: JFM 2020: JFMAMJ   JASOND 2019: JFMAMJ   JASOND 2018: JFMAMJ   JASOND 2017: ND Comments disabled

Subject: A formal language puzzle Path: you​!your-host​!walldrug​!central-scrutinizer​!fpuzhpx​!plovergw​!ploverhub​!shitpost​!mjd Date: 2021-03-14T14:09:10 Newsgroup: comp.lang.haskell.formal-language-question Message-ID: <d72be256bce765f7@shitpost.plover.com> Content-Type: text/shitpost Suppose !!\mathcal L!! is a regular language and there is some string !!t!! that is a substring of every element of !!\mathcal L!!. Is it necessarily the case that there must exist regular languages !!A!! and !!B!! such that $$\mathcal L = A t B?$$