More ties than we thought

We extend the existing enumeration of neck tie-knots to include tie-knots with a textured front, tied with the narrow end of a tie. These tie-knots have gained popularity in recent years, based on reconstructions of a costume detail from The Matrix Reloaded, and are explicitly ruled out in the enume...

Full description

Bibliographic Details
Main Authors: Dan Hirsch, Ingemar Markström, Meredith L. Patterson, Anders Sandberg, Mikael Vejdemo-Johansson
Format: Article
Language:English
Published: PeerJ Inc. 2015-05-01
Series:PeerJ Computer Science
Subjects:
Online Access:https://peerj.com/articles/cs-2.pdf
id doaj-11770e7513304887a67f43caade249d8
record_format Article
spelling doaj-11770e7513304887a67f43caade249d82020-11-24T23:58:48ZengPeerJ Inc.PeerJ Computer Science2376-59922015-05-011e210.7717/peerj-cs.2More ties than we thoughtDan Hirsch0Ingemar Markström1Meredith L. Patterson2Anders Sandberg3Mikael Vejdemo-Johansson4Upstanding Hackers Inc.KTH Royal Institute of Technology, Stockholm, SwedenUpstanding Hackers Inc.Oxford University, UKKTH Royal Institute of Technology, Stockholm, SwedenWe extend the existing enumeration of neck tie-knots to include tie-knots with a textured front, tied with the narrow end of a tie. These tie-knots have gained popularity in recent years, based on reconstructions of a costume detail from The Matrix Reloaded, and are explicitly ruled out in the enumeration by Fink & Mao (2000). We show that the relaxed tie-knot description language that comprehensively describes these extended tie-knot classes is context free. It has a regular sub-language that covers all the knots that originally inspired the work. From the full language, we enumerate 266,682 distinct tie-knots that seem tie-able with a normal neck-tie. Out of these 266,682, we also enumerate 24,882 tie-knots that belong to the regular sub-language.https://peerj.com/articles/cs-2.pdfNecktie knotsFormal languageAutomataChomsky hierarchyGenerating functions
collection DOAJ
language English
format Article
sources DOAJ
author Dan Hirsch
Ingemar Markström
Meredith L. Patterson
Anders Sandberg
Mikael Vejdemo-Johansson
spellingShingle Dan Hirsch
Ingemar Markström
Meredith L. Patterson
Anders Sandberg
Mikael Vejdemo-Johansson
More ties than we thought
PeerJ Computer Science
Necktie knots
Formal language
Automata
Chomsky hierarchy
Generating functions
author_facet Dan Hirsch
Ingemar Markström
Meredith L. Patterson
Anders Sandberg
Mikael Vejdemo-Johansson
author_sort Dan Hirsch
title More ties than we thought
title_short More ties than we thought
title_full More ties than we thought
title_fullStr More ties than we thought
title_full_unstemmed More ties than we thought
title_sort more ties than we thought
publisher PeerJ Inc.
series PeerJ Computer Science
issn 2376-5992
publishDate 2015-05-01
description We extend the existing enumeration of neck tie-knots to include tie-knots with a textured front, tied with the narrow end of a tie. These tie-knots have gained popularity in recent years, based on reconstructions of a costume detail from The Matrix Reloaded, and are explicitly ruled out in the enumeration by Fink & Mao (2000). We show that the relaxed tie-knot description language that comprehensively describes these extended tie-knot classes is context free. It has a regular sub-language that covers all the knots that originally inspired the work. From the full language, we enumerate 266,682 distinct tie-knots that seem tie-able with a normal neck-tie. Out of these 266,682, we also enumerate 24,882 tie-knots that belong to the regular sub-language.
topic Necktie knots
Formal language
Automata
Chomsky hierarchy
Generating functions
url https://peerj.com/articles/cs-2.pdf
work_keys_str_mv AT danhirsch moretiesthanwethought
AT ingemarmarkstrom moretiesthanwethought
AT meredithlpatterson moretiesthanwethought
AT anderssandberg moretiesthanwethought
AT mikaelvejdemojohansson moretiesthanwethought
_version_ 1725449631061508096