6533b830fe1ef96bd12971ab

RESEARCH PRODUCT

Regular Varieties of Automata and Coequations

J. SalamancaA. Ballester-bolinchesM.m. BonsangueE. Cosme-llópezJ.j.m.m. RuttenR. HinzeJ. Voigtländer

subject

Discrete mathematicsData ScienceDuality (mathematics)Homomorphic encryptionCharacterization (mathematics)Nonlinear Sciences::Cellular Automata and Lattice GasesAutomatonDeterministic automatonComputingMethodologies_DOCUMENTANDTEXTPROCESSINGQuantum finite automataLecture Notes in Computer ScienceÀlgebraAlgebra over a fieldComputer Science::Formal Languages and Automata TheoryAutomatitzacióMathematics

description

In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Ll´opez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff’s theorem for regular varieties.

yearjournalcountryeditionlanguage
2015-01-01
http://hdl.handle.net/2066/143770