Results 291 to 300 of about 14,469 (313)
Some of the next articles are maybe not open access.
Bull. EATCS, 1988
After the presentation of some notions and terminology which give an alternative and simple characterisation of minimal deterministic finite automata (abbr:dfa) it is shown that the derivation closure of a finite family of regular languages \({\mathfrak L}\) constitutes the set of states of a minimal dfa which accepts \({\mathfrak L}\). The benefits of
openaire +1 more source
After the presentation of some notions and terminology which give an alternative and simple characterisation of minimal deterministic finite automata (abbr:dfa) it is shown that the derivation closure of a finite family of regular languages \({\mathfrak L}\) constitutes the set of states of a minimal dfa which accepts \({\mathfrak L}\). The benefits of
openaire +1 more source
Finite automata theory with membership values in lattices
Information Sciences, 2011Yongming Li
exaly
Matrix expression and reachability analysis of finite automata
Journal of Control Theory and Applications, 2012Xiangru Xu, Yiguang Hong
exaly
Descriptional and computational complexity of finite automata—A survey
Information and Computation, 2011Markus Holzer, Martin Kutrib
exaly
Constructions for alternating finite automata∗
International Journal of Computer Mathematics, 1990H Jürgensen
exaly
A novel matrix approach to observability analysis of finite automata
International Journal of Systems Science, 2017Xiaoguang Han, Zengqiang Chen
exaly
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences, 2007Yongming Li
exaly