Skip to search formSkip to main contentSkip to account menu

Thue (programming language)

Known as: Thue programming language 
Thue (/ˈtuːeɪ/ TOO-ay) is an esoteric programming language invented by John Colagioia in early 2000. It is a meta-language that can be used to define… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Chomsky hierarchyConstraint programmingEsoteric programming languageMarkov algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Experience Management with Beliefs, Desires, and Intentions for Virtual Agents
Intelligent interactive narrative systems often use an experience manager to govern the behavior of non-player charactersin a… 
2018
2018
Network-Based Procedural Story Generation
Procedural story generation has become an important research area due to its attractiveness to computer entertainment… 
2016
2016
Nonrepetitive colorings of line arrangements
2016
2016
Forced Repetitions over Alphabet Lists
Thue [14] showed that there exist arbitrarily long square-free strings over an alphabet of three symbols (not true for two… 
2015
2015
On a Generalization of Thue Sequences
A sequence is Thue or nonrepetitive if it does not contain a repetition of any length. We consider a generalization of this… 
Review
2013
Review
2013
Non-constructive Methods for Avoiding Repetitions in Words
We survey several different non-constructive methods for showing the avoidability of certain kinds of repetitions in words. 
2009
2009
THUE’S LEMMA AND BINARY FORMS
Recently I learned (from Mariah Hamel) about Thue’s Lemma, an elementary result about congruences modulo p due to the Norwegian… 
Review
2003
Review
2003
The Fixing Block Method in Combinatorics on Words
We give an overview of the method of fixing blocks introduced by Shelton. We apply the method to words which are nonrepetitive up… 
2001
2001
Thue inequalities with a small number of primitive solutions
Several upper bounds are known for the numbers of primitive solutions (x; y) of the Thue equation (1) j F(x; y) j = m and the… 
1954
1954
On intervals containing an affinely equivalent set of $n$ integers mod $k$
L. J. MORDELL 1. Let n > 2 be a given positive integer and (x) = (x1, x2, , x.) a given set of n integers. Let k be a given… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)