On the State Minimization of Nondeterministic Finite Automata

DOI10.1109/T-C.1970.222994MaRDI QIDQ5590818zbMATH OpenOpenAlexWikidataFDO

Authors Tsunehiko Kameda, P. Weiner

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

Cited in

(31)

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

This page was built for publication: On the State Minimization of Nondeterministic Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590818)