Sebastian John  Home/Search
Context
Related
| cs.tuberlin.de/cs/ifb/...TR2003_22.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: cs.tuberlin.de...hnBerichteListe (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A nondeterministic finite automaton with #-transitions (#NFA) accepts a regular language. Among the #NFA accepting a certain language some are more compact than others. This essay treats the problem how to compactify a given #NFA by reducing the number of transitions. Compared to the standard techniques to minimize deterministic complete finite automata (complete DFA) two novel features matter in compactifying #NFA : the principle of transition partition and the principle of transition... (Update)
Active bibliography (related documents): More All
0.9: 3-Party Message Complexity is Better than 2-Party Ones for.. - Adorna (2002) (Correct)
0.5: A Taxonomy of Finite Automata Minimization Algorithms - Watson (1994) (Correct)
0.5: Efficient Submatch Addressing for Regular Expressions - Laurikari (Correct)
Similar documents based on text: More All
0.3: Computing epsilon-Free NFA from Regular Expressions in O(n.. - Hagenah, Muscholl (Correct)
0.2: Separating Exponentially Ambiguous Finite - Automata From Polynomially (Correct)
0.2: Computing Small Nondeterministic Finite Automata - Matz, Potthoff (1995) (Correct)
BibTeX entry: (Update)
@misc{ john-minimal,
author = "Sebastian John",
title = "Minimal Unambiguous εNFA",
url = "citeseer.ist.psu.edu/john04minimal.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
100 Gedanken-experiments on sequential machines (context) - Moore - 1956
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
57 algorithm for minimizing states in a finite automaton (context) - Hopcroft, An et al. - 1971
38 Linear automaton transformations (context) - Nerode - 1958
28 The synthesis of sequential switching circuits (context) - Huffman - 1954
24 Economy of description by automata (context) - Meyer, Fischer - 1971
24 Method for synthesizing sequential circuits (context) - Mealy - 1955
14 Finite automata and the representation of events (context) - Myhill - 1957
14 Canonical regular expressions and minimal state graphs for d.. (context) - Brzozowski - 1962
10 the equivalence and containment problems for unambiguous reg.. (context) - Stearns, Hunt - 1981
6 Relating the type of ambiguity of finite automata to the suc.. (context) - Ravikumar, Ibarra - 1989
6 Parsing Theory (context) - Sippu, Soisalon-Soininen - 1988
6 Succinctness of descriptions of contextfree (context) - Schmidt - 1978
5 A note about minimal non-deterministic automata - Arnold, Dicky et al. - 1992
4 Computing small nondeterministic finite automata - Matz, Potthoff - 1995
3 On minimizing finite automata (context) - Brauer - 1988
3 State complexity of basic operations on nondeterministic fin.. - Holzer, Kutrib - 2002
2 State minimization of nondeterministic machines (context) - Kim - 1974
2 the state minimization of nondeterministic finite automata (context) - Kameda, Weiner - 1970
2 Programming techniques: Regular expression search algorithm (context) - Thompson - 1968
1 Einige Bemerkungen ber nichtdeterministische Automaten (context) - Starke - 1966
1 ber Homomorphie und Reduktion bei nicht-deterministischen Au.. (context) - Neuber, Starke - 1967
1 The Design and Anlalysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
Documents on the same site (http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html): More
Compiler Support for Specification and Justification -.. - Didrich (1999) (Correct)
A Taste of Categorical Petri Nets - Ermel, Martini (1996) (Correct)
Action Nets and Abstract Statecharts in the Theory of.. - Ehrig, Gajewsky, Padberg (1997) (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