Abstract
A cover language is a superset of a given language. Deterministic Finite Cover Automata (DFCA) are Deterministic Finite Automata (DFA) accepting finite languages and other words longer than any word in the given language. Some papers from the 60’s were constructing DFCAs as a byproduct using ad-hoc procedures, but DFCAs have never been defined until 1998. The notion of Deterministic Finite Cover Automaton, which is based on the concept of similarity relations, was introduced for the very first time at WIA’98, where the authors give the first rigorous formal definition and a clear minimization algorithm.
We will present a survey of the most important results related to cover automata, and will show the importance of the implementation in obtaining, verifying, and solving new results.
A list of open problems related to cover automata, together with some possible approaches will be presented.
Features of the software packages Grail, miniGrail, and Lisa will be exposed. A list of open problems related to challenges and limitations encountered when using software packages implementing automata, languages, and related objects will be shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Câmpeanu, C. (2013). Cover Languages and Implementations. In: Konstantinidis, S. (eds) Implementation and Application of Automata. CIAA 2013. Lecture Notes in Computer Science, vol 7982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39274-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-39274-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39273-3
Online ISBN: 978-3-642-39274-0
eBook Packages: Computer ScienceComputer Science (R0)