Weighted synchronous automata

This paper introduces a class of automata and associated languages, suitable to model a computational paradigm of fuzzy systems, in which both vagueness and simultaneity are taken as first-class citizens. This requires a weighted semantics for transitions and a precise notion of a synchronous produc...

Full description

Saved in:
Bibliographic Details
Published inMathematical structures in computer science Vol. 32; no. 9; pp. 1234 - 1253
Main Authors Gomes, Leandro, Madeira, Alexandre, Barbosa, Luis Soares
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.10.2022
Subjects
Algebra
Behavior
Boolean
Fuzzy systems
Languages
Semantics
Special Issue: LSFA’19 and LSFA’20
regular languages
Weighted automata
synchronous languages
Online AccessGet full text

Cover

More Information
Summary:This paper introduces a class of automata and associated languages, suitable to model a computational paradigm of fuzzy systems, in which both vagueness and simultaneity are taken as first-class citizens. This requires a weighted semantics for transitions and a precise notion of a synchronous product to enforce the simultaneous occurrence of actions. The usual relationships between automata and languages are revisited in this setting, including a specific Kleene theorem.
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129522000421