We investigate different notions of nominal words, that is, words that my contain letters from an alphabet as well as names and name-binders. In a first section we construct them from first principles. In a second section we take the point of view that—as in the classical case—words over an alphabet S form a free monoid over S. We define different notions of nominal monoids and reveal nominal words as elements of free nominal monoids. Applications to computer science will be treated in subsequent work.
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
We introduce formal languages over infinite alphabets where words may contain binders.We define the ...
We introduce formal languages over infinite alphabets where words may contain binders.We define the ...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
Abstract. The notion of Σ-monoids is proposed by Fiore, Plotkin and Turi, to give abstract algebraic...
The theories of formal language and automata are fundamental in several areas of computer science. D...
The theories of formal language and automata are fundamental in several areas of computer science. D...
The theories of formal language and automata are fundamental in several areas of computer science. D...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
We study languages over infinite alphabets equipped with some structure thatcan be tested by recogni...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
We introduce formal languages over infinite alphabets where words may contain binders.We define the ...
We introduce formal languages over infinite alphabets where words may contain binders.We define the ...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
Abstract. The notion of Σ-monoids is proposed by Fiore, Plotkin and Turi, to give abstract algebraic...
The theories of formal language and automata are fundamental in several areas of computer science. D...
The theories of formal language and automata are fundamental in several areas of computer science. D...
The theories of formal language and automata are fundamental in several areas of computer science. D...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
We study languages over infinite alphabets equipped with some structure thatcan be tested by recogni...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...