A non-deterministic finite automata minimization method based on the preorder relation

MaRDI QIDQ3017223zbMATH OpenFDO

Authors Mingming Zhang, Yongbin Qin

Publication date 19 July 2011

zbMATH Keywords

non-deterministic finite automatapreorder relationstate merging

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The minimization of a kind of non-deterministic finite automata
• scientific article; zbMATH DE number 2040906
• NFA reduction algorithms by means of regular inequalities
• scientific article; zbMATH DE number 1309169
• Left is Better Than Right for Reducing Nondeterminism of NFAs

Cited in

(4)

• The minimization of a kind of non-deterministic finite automata
• scientific article; zbMATH DE number 1538176 (Why is no real title available?)
• NFA reduction algorithms by means of regular inequalities
• The best nondeterministic representations of finite orderings.

This page was built for publication: A non-deterministic finite automata minimization method based on the preorder relation

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