2 papers
cs.FL2022
Ordering Regular Languages and Automata: Complexity
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Given an order of the underlying alphabet we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When th…
cs.FL2021
Ordering regular languages: a danger zone
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering the collection of states of a given automaton starting from an order of the underlying alphabet is a natural move towards a computational treatment of the language accepte…