Open AccessBook
Syntactic semigroups
Jean-Eric Pin
- pp 679-746
Reads0
Chats0
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.Abstract:
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Syntactic semigroups Jean-Eric Pinread more
Citations
More filters
Book
The q-theory of Finite Semigroups
John Rhodes,Benjamin Steinberg +1 more
TL;DR: The q-theory of finite semigroups as mentioned in this paper is a theory that provides a unifying approach to finite semigroup theory via quantization, and it is the only contemporary exposition of the complete theory of the complexity of finite semiigroups.
Posted Content
Symbolic dynamics
TL;DR: This chapter presents some of the links between automata theory and symbolic dynamics, including the connection between syntactic semigroups and the classification of sofic shifts up to conjugacy.
Journal ArticleDOI
Series-parallel languages and the bounded-width property
Kamal Lodaya,P. Weil +1 more
TL;DR: The algebraic properties of the set of series–parallel posets are used to investigate the notion of recognizability, based on finite-index congruences, and a notion of regularity based on a new class of “branching” automata.
Book ChapterDOI
Deciding Properties for Message Sequence Charts
TL;DR: An automatic validation algorithm is presented for systems described using the message sequence charts notation, tightly related to a natural language-theoretic problem over semi-traces (a generalization of Mazurkiewicz traces, which represent partially ordered executions).
References
More filters
Book
Automata, Languages, and Machines
TL;DR: This book attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest in formal languages and automata, written by Professor Ian Chiswell.
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.
Book ChapterDOI
Weak Second-Order Arithmetic and Finite Automata
TL;DR: The formalism of regular expressions was introduced by S. C. Kleene to obtain the following basic theorems.