Publication

Ordering of Characters and Strings

Alfred Strohmeier
1990
Conference Papers

Abstract

Arranging characters and strings in order of representation codes is not suitable for application programming. Even when character ordering is logical, the usual filing of words in dictionaries does not correspond with the mathematical lexicographic ordering of strings, but some equivalence relation on characters is involved. As a solution to this problem, we propose a generic package. The paper also explains the theory behind the solution. Some definitions of classical mathematics are recalled in the appendix.

Official source

https://infoscience.epfl.ch/entities/publication/c274f7d4-335f-4f32-9b24-affbea87e1d9

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Alfred Strohmeier
1990
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/c274f7d4-335f-4f32-9b24-affbea87e1d9

About this result

Related concepts (32)

Lexicographic order

In mathematics, the lexicographic or lexicographical order (also known as lexical order, or dictionary order) is a generalization of the alphabetical order of the dictionaries to sequences of ordered symbols or, more generally, of elements of a totally ordered set. There are several variants and generalizations of the lexicographical ordering. One variant applies to sequences of different lengths by comparing the lengths of the sequences before considering their elements.

Weak ordering

In mathematics, especially order theory, a weak ordering is a mathematical formalization of the intuitive notion of a ranking of a set, some of whose members may be tied with each other. Weak orders are a generalization of totally ordered sets (rankings without ties) and are in turn generalized by (strictly) partially ordered sets and preorders.

Logic

Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or logical truths. It studies how conclusions follow from premises due to the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. It examines arguments expressed in natural language while formal logic uses formal language.

Related publications (6)

Ordering of Characters and Strings

Chat with Graph Search

On Decision Procedures for Ordered Collections

Learning and Control of UAV maneuvers Based on Demonstrations

Calibration from statistical properties of the visual world