SE-systems, timing mechanisms, and time-varying codes

Ferucio Laurenţiu Ţiplea; Erkki Mäkinen; Constantin Enea

doi:10.1080/00207160212709

SE-systems, timing mechanisms, and time-varying codes

Ferucio Laurenţiu Ţiplea
, Erkki Mäkinen
, Constantin Enea

Research output: Contribution to journal › Article › peer-review

Abstract

We show that synchronized extension systems [17] can be successfully used to simulate timing mechanisms incorporated into grammars and automata [3, 7-9, 12]. Further, we introduce the concept of a time-varying code as a natural generalization of L-codes, and the relationship with classical codes, gsm codes and SE-codes is established. Finally, an algorithm for testing the time-varying code property in case of periodicity is given.

Original language	English
Pages (from-to)	1083-1091
Number of pages	9
Journal	International Journal of Computer Mathematics
Volume	79
Issue number	10
DOIs	https://doi.org/10.1080/00207160212709
Publication status	Published - 1 Dec 2002
Externally published	Yes

Keywords

Codes
Formal languages and automata
Synchronized extension systems
Time-varying grammars and automata

Access to Document

10.1080/00207160212709

Cite this

@article{4b61e1cadf704ffdad67762d26a30da4,

title = "SE-systems, timing mechanisms, and time-varying codes",

abstract = "We show that synchronized extension systems [17] can be successfully used to simulate timing mechanisms incorporated into grammars and automata [3, 7-9, 12]. Further, we introduce the concept of a time-varying code as a natural generalization of L-codes, and the relationship with classical codes, gsm codes and SE-codes is established. Finally, an algorithm for testing the time-varying code property in case of periodicity is given.",

keywords = "Codes, Formal languages and automata, Synchronized extension systems, Time-varying grammars and automata",

author = "{\c T}iplea, \{Ferucio Lauren{\c t}iu\} and Erkki M{\"a}kinen and Constantin Enea",

year = "2002",

month = dec,

day = "1",

doi = "10.1080/00207160212709",

language = "English",

volume = "79",

pages = "1083--1091",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

number = "10",

}

TY - JOUR

T1 - SE-systems, timing mechanisms, and time-varying codes

AU - Ţiplea, Ferucio Laurenţiu

AU - Mäkinen, Erkki

AU - Enea, Constantin

PY - 2002/12/1

Y1 - 2002/12/1

N2 - We show that synchronized extension systems [17] can be successfully used to simulate timing mechanisms incorporated into grammars and automata [3, 7-9, 12]. Further, we introduce the concept of a time-varying code as a natural generalization of L-codes, and the relationship with classical codes, gsm codes and SE-codes is established. Finally, an algorithm for testing the time-varying code property in case of periodicity is given.

AB - We show that synchronized extension systems [17] can be successfully used to simulate timing mechanisms incorporated into grammars and automata [3, 7-9, 12]. Further, we introduce the concept of a time-varying code as a natural generalization of L-codes, and the relationship with classical codes, gsm codes and SE-codes is established. Finally, an algorithm for testing the time-varying code property in case of periodicity is given.

KW - Codes

KW - Formal languages and automata

KW - Synchronized extension systems

KW - Time-varying grammars and automata

UR - https://www.scopus.com/pages/publications/0012672684

U2 - 10.1080/00207160212709

DO - 10.1080/00207160212709

M3 - Article

AN - SCOPUS:0012672684

SN - 0020-7160

VL - 79

SP - 1083

EP - 1091

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 10

ER -

SE-systems, timing mechanisms, and time-varying codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this