Lynette van Zijl  Home/Search
Context
Related
| cs.sun.ac.za/~lynette...ksnfatcs.ps.gz 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: cs.sun.ac.za/~lynette/publicat... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We de ne generalized acceptance in nondeterministic nite automata, in order to achieve more instances of succinct descriptions of regular languages in practical applications. We show that generalized acceptance enable the construction of a hierarchy of succinct nondeterministic descriptions for nite automata. The hierarchy corresponds to deterministic nite automata on level 0 and nondeterministic nite automata on level 1 by default, and we prove that the hierarchy corresponds to alternating... (Update)
Similar documents based on text: More All
1.1: Supernondeterministic Finite Automata - van Zijl (2001) (Correct)
0.9: Succinct Descriptions of Regular Languages with Binary -NFAs - Lynette Van Zijl (Correct)
0.9: Random Number Generation with -NFAs - Lynette Van Zijl (Correct)
BibTeX entry: (Update)
@misc{ zijl-generalized,
author = "Lynette van Zijl",
title = "Generalized Acceptance, Succinctness and Supernondeterministic Finite Automata",
url = "citeseer.ist.psu.edu/vanzijl03generalized.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
20 Succinct Representation of Regular Languages by Boolean Auto.. (context) - Leiss - 1981
6 Generalized Nondeterminism and the Succinct Representation o.. - van Zijl - 1997
3 NFAs Bitstream-Based Random Generation (context) - Champarnaud - 2002
1 Supernondeterministic Finite Automata - van Zijl - 2001
Documents on the same site (http://www.cs.sun.ac.za/~lynette/publications/): More
South African Sign Language Machine Translation System - van Zijl (Correct)
Nondeterminism and Succinctly Representable Regular Languages - van Zijl (2002) (Correct)
Supernondeterministic Finite Automata - van Zijl (2001) (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