Result: The growth ratio of synchronous rational relations is unique
Title:
The growth ratio of synchronous rational relations is unique
Authors:
Source:
Developments in language theoryTheoretical computer science. 376(1-2):52-59
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 8 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Informatique théorique, Computer theory, Informática teórica, Transducteur, Transducer, Transductor, Algorithme synchronisation, Synchronization algorithm, Fermeture booléenne, Nombre rationnel, Relation rationnelle, Relation α-synchrone, α-synchronous relation
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
LIAFA, Université Paris 7 & CNRS, 2, pl. Jussieu, 75251 Paris, France
ISSN:
0304-3975
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18748487
Database:
PASCAL Archive
Further Information
We introduce α-synchronous relations for a rational number a. We show that if a rational relation is both α- and α'-synchronous for two different numbers a and α', then it is recognizable. We give a synchronization algorithm for α-synchronous transducers. We also prove the closure under boolean operations and composition of α-synchronous relations.