Minimal cover-automata for finite languages

Theoretical Computer Science

Volumn 267, Issue 1-2, 2001, Pages 3-16

  Campeanu C ^a   Santean N ^a   Yu, S ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Cover language; Deterministic cover automata; Deterministic finite automata; Finite languages

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; PARALLEL PROCESSING SYSTEMS;

FINITE LANGUAGES;

FINITE AUTOMATA;

EID: 0035964975     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00292-9     Document Type: Article

References (12)

1. Uniform characterisations of non-uniform complexity measures
2. Regular languages and programming languages
3. A time complexity gap for two-way probabilistic finite-state automata
4. Minimal nontrivial space space complexity of probabilistic one-way turing machines
5. Running time to recognise non-regular languages by 2-way probabilistic automata
6. A class of measures on formal languages
7. Automaticity I: Properties of a measure of descriptional complexity
8. The state complexities of some basic operations on regular languages
9. Regular languages
10. On the state complexity of intersection of regular languages