Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems
IBM Journal of Research and Development
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Some minimality results on biresidual and biseparable automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
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 of 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 union. An algorithm for compactifying εNFA is presented that exploits the union principle. This algorithm has the following property: if the algorithm returns an unambiguous automaton, then this automaton is the transition minimal εNFA.