On the State Minimization of Nondeterministic Finite Automata

DOI10.1109/T-C.1970.222994zbMath0195.02701OpenAlexW2061668791WikidataQ56883070 ScholiaQ56883070MaRDI QIDQ5590818

P. Weiner, Tsunehiko Kameda

Publication date: 1970

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1970.222994

zbMATH Keywords

languages, automata, networks

Related Items

Multiheuristic approach to discrete optimization problems, On size reduction techniques for multitape automata, Some more algorithms for Conway's universal automaton, On the Inference of Finite State Automata from Positive and Negative Data, Duality of Lattices Associated to Left and Right Quotients, Nondeterministic Moore automata and Brzozowski's minimization algorithm, Theory of átomata, MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON, Nondeterministic syntactic complexity, Forward Bisimulations for Nondeterministic Symbolic Finite Automata, A lower bound technique for the size of nondeterministic finite automata, ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON, Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited, Bideterministic automata and minimal representations of regular languages, NFA reduction algorithms by means of regular inequalities, Limitations of lower bound methods for deterministic nested word automata, On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's, Fuzzy relation equations and reduction of fuzzy automata, Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity, Reduction of fuzzy automata by means of fuzzy quasi-orders, Nondeterministic Moore Automata and Brzozowski’s Algorithm, A theory of ultimately periodic languages and automata with an application to time granularity, Compact Normal Form for Regular Languages as Xor Automata, NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY, Some more on the basis finite automaton, Minimisation of automata, Descriptional complexity of regular languages, Yet another canonical nondeterministic automaton