Publicação

Weighted synchronous automata

Ver documento

Detalhes bibliográficos
Resumo: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.
Autores principais:Gomes, Leandro
Outros Autores:Madeira, Alexandre; Barbosa, Luis Soares
Assunto:Weighted automata Regular languages Synchronous languages
Ano:2023
País:Portugal
Tipo de documento:artigo
Tipo de acesso:acesso aberto
Instituição associada:Universidade de Aveiro
Idioma:inglês
Origem:RIA - Repositório Institucional da Universidade de Aveiro
Descrição
Resumo: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.