More on deterministic and nondeterministic finite cover automata
| Autor: | Sebastian Jakobi, Markus Holzer, Hermann Gruber |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Nested word General Computer Science 0102 computer and information sciences 02 engineering and technology ω-automaton Nonlinear Sciences::Cellular Automata and Lattice Gases 01 natural sciences Theoretical Computer Science TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Deterministic finite automaton DFA minimization 010201 computation theory & mathematics Deterministic automaton 0202 electrical engineering electronic engineering information engineering Quantum finite automata Automata theory 020201 artificial intelligence & image processing Nondeterministic finite automaton Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Theoretical Computer Science. 679:18-30 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2016.10.006 |
| Popis: | Finite languages are an important sub-regular language family, which were intensively studied during the last two decades in particular from a descriptional complexity perspective. An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite cover automata (DFCAs and NFCAs, respectively) as an alternative representation of finite languages by ordinary finite automata. We compare these two types of cover automata from a descriptional complexity point of view, showing that these devices have a lot in common with ordinary finite automata. In particular, we study how to adapt lower bound techniques for nondeterministic finite automata to NFCAs such as, e.g., the biclique edge cover technique, solving an open problem from the literature. Moreover, the trade-off of conversions between DFCAs and NFCAs as well as between finite cover automata and ordinary finite automata are investigated. Finally, we present some results on the average size of finite cover automata. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect