Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'488'730
Articles rated: 2609

29 March 2024
 
  » arxiv » 1712.8455

 Article overview


On Varieties of Ordered Automata
Ondřej Klíma ; Libor Polák ;
Date 22 Dec 2017
AbstractThe classical Eilenberg correspondence, based on the concept of the syntactic monoid, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence appeared, with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. For example, classes of languages need not be closed under complementation or all preimages under homomorphisms, while monoids can be equipped with a compatible order or they can have a distinguished set of generators. Such generalized varieties and pseudovarieties also have natural counterparts formed by classes of finite (ordered) automata. In this paper the previous approaches are combined. The notion of positive $mathcal C$-varieties of ordered semiautomata (i.e. no initial and final states are specified) is introduced and their correspondence with positive $mathcal C$-varieties of languages is proved.
Source arXiv, 1712.8455
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica