Skip to search formSkip to main contentSkip to account menu
Varieties of Formal Languages
View via Publisher
Syntactic Semigroups
  • J. Pin
  • Economics
    Handbook of Formal Languages
  • 1 April 1997
TLDR
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad, or from public or private research centers.
View via Publisher
A variety theorem without complementation
A new dwarf carnation plant suitable for growing in pots producing flowers of red coloration.
Infinite words - automata, semigroups, logic and games
  • D. Perrin, J. Pin
  • Mathematics
    Pure and applied mathematics series
  • 12 February 2004
View via Publisher
Polynomial closure and unambiguous product
  • J. Pin, P. Weil
  • Mathematics, Computer Science
    Theory of Computing Systems
  • 10 July 1995
TLDR
It is shown that if a language and its complement are in the polynomial closure of a variety of languages, then this language can be written as a disjoint union of marked unambiguous products of languages of the variety.
View on Springer
Duality and Equational Theory of Regular Languages
TLDR
This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the authors about Stone and Priestley duality, and shows for instance that any class ofregular languages defined by a fragment of logic closed under conjunctions and disjunctions admits an equational description.
View via Publisher
On two Combinatorial Problems Arising from Automata Theory
View via Publisher
On Reversible Automata
  • J. Pin
  • Mathematics
    LATIN
  • 6 April 1992
TLDR
Four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states are given and it is shown that one can effectively decide whether a given rational (or regular) language can be accepted by the automaton.
View via Publisher
First-Order Logic and Star-Free Sets
View via Publisher
A conjecture on the Hall topology for the free group
The Hall topology for the free group is the coarsest topology such that every group morphism from the free group onto a finite discrete group is continuous. It was shown by M. Hall Jr. that every…
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License