query: Show that this language has (or does not have) unique writing for words
positive_passages.docid: 23707
positive_passages.text: How can I prove that every word has unique representation?
negative_passages.docid: 104351
negative_passages.text: Unique random string generation
negative_passages.docid: 34099
negative_passages.text: Proving that the empty set is unique
negative_passages.docid: 61497
negative_passages.text: Possessive of a word that is already possessive
negative_passages.docid: 61602
negative_passages.text: Binary strings (words) proof
negative_passages.docid: 49470
negative_passages.text: How can I draw arrows between words in linguistic examples?
negative_passages.docid: 119722
negative_passages.text: Preventing hyphenation of specific short, repeated, hyphenated words
negative_passages.docid: 114931
negative_passages.text: Extend a language with additional keywords?
negative_passages.docid: 28536
negative_passages.text: Why are these words ungrammatical
negative_passages.docid: 136362
negative_passages.text: Marking plural of code words
negative_passages.docid: 125811
negative_passages.text: Recognizing special cases of a defined function for permuted arguments
negative_passages.docid: 137471
negative_passages.text: Permutations of a string with duplicate characters
negative_passages.docid: 99929
negative_passages.text: express in words without using the symbol N
negative_passages.docid: 123598
negative_passages.text: Showing the set of DFAs that accept nonempty languages is decidable
negative_passages.docid: 101719
negative_passages.text: Finding the n-th lexicographic permutation of a string
negative_passages.docid: 3454
negative_passages.text: Why do some words use duplicate letters seemingly without reason?
negative_passages.docid: 62541
negative_passages.text: Determining a string has all unique characters without using additional data structures and without the lowercase characters assumption