Two Extensions of Cover Automata

Two Extensions of Cover Automata

Deterministic Finite Cover Automata (DFCA) are compact representations of finite languages. Deterministic Finite Automata with “do not care” symbols and Multiple Entry Deterministic Finite Automata are both compact representations of regular languages. This paper studies the benefits of combining th...

Full description

Bibliographic Details
Main Author: Cezar Câmpeanu
Format: Article
Language:English
Published: MDPI AG 2021-12-01
Series:Axioms
Subjects:
finite languages
deterministic finite cover automata
multiple entry automata
automata with “do not care” symbols
similarity relations
Online Access:https://www.mdpi.com/2075-1680/10/4/338

Internet

https://www.mdpi.com/2075-1680/10/4/338

Similar Items