Heiko Körner  Home/Search
Context
Related
| mmdb.iai.unibonn.de/./...IJFSCmca.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mmdb.iai.unibo...ublications.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A deterministic finite automaton (DFA) is called a cover automaton (DFCA) for a finite language L over some alphabet # if L = L(A) # #l , with l being the length of some longest word in L. Thus a word w # # is in L if and only if L(A). (Update)
Active bibliography (related documents): More All
0.2: On Minimizing Cover Automata for Finite Languages in O(n log n).. - Körner (Correct)
0.2: Minimal Covers of Formal Languages - Domaratzki (2001) (Correct)
0.2: State Complexity of Regular Languages - Yu (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ rner-time,
author = "Heiko Körner",
title = "A Time And Space Efficient Algorithm For Minimizing Cover Automata For
Finite Languages",
url = "citeseer.ist.psu.edu/749744.html" }
Citations (may not include all citations):154 Introduction to Algorithms (context) - Corman, Leiserson et al. - 1990
97 Introduction to Automata Theory, Languages and Computation (context) - Hopcroft, Ullman - 1979
36 An n log n algorithm for minimizing the states in a finite a.. (context) - Hopcroft - 1971
4 Minimal Cover--Automata for Finite Languages - Campeanu, Santean et al. - 1998
1 An E#cient Algorithm for Constructing Minimal Cover Automata.. (context) - Campeanu, Paun et al. - 2000
1 The Number of Similarity Relations and the Number of Minimal.. (context) - Campeanu, Paun - 2002
1 An O(n) Algorithm for Constructing Minimal Cover Automata fo.. (context) - Paun, Santean et al. - 2000
Documents on the same site (http://www-mmdb.iai.uni-bonn.de/publications.php): More
Content-based Retrieval in MIDI and Audio - Clausen, Kurth, Engelbrecht (2001) (Correct)
Time and Space Efficient Algorithms for Decomposing Certain.. - Goeman (Correct)
On Parsing and Condensing Substrings of LR Languages in Linear Time - Goeman (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC