Embed Notice

HTML Code

<blockquote style="position: relative; padding-left: 55px;"><section><a href="https://mathstodon.xyz/users/noamzoam/statuses/113544034316773143">Noam Zeilberger (noamzoam@mathstodon.xyz)'s status on Monday, 25-Nov-2024 23:35:26 JST</a><a href="https://mathstodon.xyz/@noamzoam" title="noamzoam@mathstodon.xyz"><img src="https://gnusocial.jp/avatar/300113-48-20241125143526.webp" width="48" height="48" alt="Noam Zeilberger" style="position: absolute; left: 0; top: 0;">Noam Zeilberger</a><div><ul><li><li><a href="https://gnusocial.jp/user/265914" title="fl@mathstodon.xyz">fl</a></li></ul></div></section><article><p><a href="https://social.sciences.re/@tito">@tito</a> <a href="https://mathstodon.xyz/@julesh">@julesh</a> <a href="https://mathstodon.xyz/@fl">@fl</a> Tito has some very interesting work with Cécilia Pradic on the expressivity problem in extensions of simply-typed lambda calculus with a affine/linear/ordered linear implication, see the "Implicit automata in typed λ-calculi" series (<a href="https://nguyentito.eu/2023-06-oxford.pdf" rel="nofollow noreferrer">https://nguyentito.eu/2023-06-oxford.pdf</a>).  One of their exciting results is that in the planar case you can recover exactly the star-free languages (<a href="https://en.wikipedia.org/wiki/Star-free_language" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Star-free_language</a>).</p></article><footer><a rel="bookmark" href="https://gnusocial.jp/conversation/4067077#notice-7947723">In conversation</a><time datetime="2024-11-25T23:35:26+09:00" title="Monday, 25-Nov-2024 23:35:26 JST">about 2 months ago</time> <span>from <span><a href="https://mathstodon.xyz/@noamzoam/113544034316773143" rel="external" title="Sent from mathstodon.xyz via ActivityPub">mathstodon.xyz</a></span></span><a href="https://mathstodon.xyz/@noamzoam/113544034316773143">permalink</a><h4>Attachments</h4><ol><li><label><a rel="external" href="https://gnusocial.jp/attachment/3564903">Untitled attachment</a></label><br></li><li><article><header><div>No result found on File_thumbnail lookup.</div><h5><a href="https://en.wikipedia.org/wiki/Star-free_language">Star-free language</a></h5><div></div></header><div>In theoretical computer science and formal language theory, a regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty word, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene star. The condition is equivalent to having generalized star height zero.
For instance, the language           Σ            ∗    {\displaystyle \Sigma ^{*}} of all finite words over an alphabet      ...</div><footer></footer></article></li></ol></footer></blockquote>

Corresponding Notice

Embed this notice
Noam Zeilberger (noamzoam@mathstodon.xyz)'s status on Monday, 25-Nov-2024 23:35:26 JSTNoam Zeilberger
- julesh
- fl
@tito @julesh @fl Tito has some very interesting work with Cécilia Pradic on the expressivity problem in extensions of simply-typed lambda calculus with a affine/linear/ordered linear implication, see the "Implicit automata in typed λ-calculi" series (https://nguyentito.eu/2023-06-oxford.pdf). One of their exciting results is that in the planar case you can recover exactly the star-free languages (https://en.wikipedia.org/wiki/Star-free_language).
In conversationabout 2 months ago from mathstodon.xyzpermalink
Attachments
1. Untitled attachment
2. No result found on File_thumbnail lookup.
  Star-free language
  In theoretical computer science and formal language theory, a regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty word, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene star. The condition is equivalent to having generalized star height zero. For instance, the language Σ ∗ {\displaystyle \Sigma ^{*}} of all finite words over an alphabet ...

Public

Embed Notice

HTML Code

Corresponding Notice