Temporal logic with cyclic counting and the degree of aperiodicity of finite automata

Z. Ésik, M. Ito

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

We define the degree of aperiodicity of finite automata and show that for every set M of positive integers, the class QAM of finite automata whose degree of aperiodicity belongs to the division ideal generated by M is closed with respect to direct products, disjoint unions, subautomata, homomorphic images and renamings. These closure conditions define q-varieties of finite automata. We show that q-varieties are in a one-to-one correspondence with literal varieties of regular languages. We also characterize QAM as the cascade product of a variety of counters with the variety of aperiodic (or counter-free) automata. We then use the notion of degree of aperiodicity to characterize the expressive power of first-order logic and temporal logic with cyclic counting with respect to any given set M of moduli. It follows that when M is finite, then it is decidable whether a regular language is definable in first-order or temporal logic with cyclic counting with respect to moduli in M.

Original languageEnglish
Pages (from-to)1-28
Number of pages28
JournalActa Cybernetica
Volume16
Issue number1
Publication statusPublished - 2003

Fingerprint

Temporal logic
Finite Automata
Finite automata
Temporal Logic
Counting
Formal languages
Regular Languages
Quadrature amplitude modulation
First-order Logic
Modulus
Homomorphic
Expressive Power
Direct Product
One to one correspondence
Cascade
Automata
Division
Disjoint
Closure
Union

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. / Ésik, Z.; Ito, M.

In: Acta Cybernetica, Vol. 16, No. 1, 2003, p. 1-28.

Research output: Contribution to journalArticle

@article{bfab969292ef4c5aab51b4034d305ac4,
title = "Temporal logic with cyclic counting and the degree of aperiodicity of finite automata",
abstract = "We define the degree of aperiodicity of finite automata and show that for every set M of positive integers, the class QAM of finite automata whose degree of aperiodicity belongs to the division ideal generated by M is closed with respect to direct products, disjoint unions, subautomata, homomorphic images and renamings. These closure conditions define q-varieties of finite automata. We show that q-varieties are in a one-to-one correspondence with literal varieties of regular languages. We also characterize QAM as the cascade product of a variety of counters with the variety of aperiodic (or counter-free) automata. We then use the notion of degree of aperiodicity to characterize the expressive power of first-order logic and temporal logic with cyclic counting with respect to any given set M of moduli. It follows that when M is finite, then it is decidable whether a regular language is definable in first-order or temporal logic with cyclic counting with respect to moduli in M.",
author = "Z. {\'E}sik and M. Ito",
year = "2003",
language = "English",
volume = "16",
pages = "1--28",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "1",

}

TY - JOUR

T1 - Temporal logic with cyclic counting and the degree of aperiodicity of finite automata

AU - Ésik, Z.

AU - Ito, M.

PY - 2003

Y1 - 2003

N2 - We define the degree of aperiodicity of finite automata and show that for every set M of positive integers, the class QAM of finite automata whose degree of aperiodicity belongs to the division ideal generated by M is closed with respect to direct products, disjoint unions, subautomata, homomorphic images and renamings. These closure conditions define q-varieties of finite automata. We show that q-varieties are in a one-to-one correspondence with literal varieties of regular languages. We also characterize QAM as the cascade product of a variety of counters with the variety of aperiodic (or counter-free) automata. We then use the notion of degree of aperiodicity to characterize the expressive power of first-order logic and temporal logic with cyclic counting with respect to any given set M of moduli. It follows that when M is finite, then it is decidable whether a regular language is definable in first-order or temporal logic with cyclic counting with respect to moduli in M.

AB - We define the degree of aperiodicity of finite automata and show that for every set M of positive integers, the class QAM of finite automata whose degree of aperiodicity belongs to the division ideal generated by M is closed with respect to direct products, disjoint unions, subautomata, homomorphic images and renamings. These closure conditions define q-varieties of finite automata. We show that q-varieties are in a one-to-one correspondence with literal varieties of regular languages. We also characterize QAM as the cascade product of a variety of counters with the variety of aperiodic (or counter-free) automata. We then use the notion of degree of aperiodicity to characterize the expressive power of first-order logic and temporal logic with cyclic counting with respect to any given set M of moduli. It follows that when M is finite, then it is decidable whether a regular language is definable in first-order or temporal logic with cyclic counting with respect to moduli in M.

UR - http://www.scopus.com/inward/record.url?scp=18744436808&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18744436808&partnerID=8YFLogxK

M3 - Article

VL - 16

SP - 1

EP - 28

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 1

ER -