- Full text PDF available (2)
- This year (0)
- Last 5 years (0)
- Last 10 years (1)
Journals and Conferences
Nondeterminism plays a central role in almost all fields of computer science. It has been incorporated naturally as well as in the theory of automata as a generalization of determinism. Although nondeterministic finite automata do not have more recognition power than deterministic ones their importance and usefulness is of no doubt. Unfortunately, the… (More)
This paper continues the discussion of teaching nondeterminism (see ) where we presented a didactic approach introducing the notion of nondeterministic automata. Although in this paper we use the same methodology we have to face up to new didactic challenges. Namely, teaching the subset construction requires answers to the question how can CAS be used in… (More)
Two equivalent sufficient conditions are given for the completeness of classes of finite automata with respect to the isomorphic simulation under the α 2 − ν 2-product. It is conjectured that these conditions are also necessary with respect to the isomorphic or homomorphic simulation too.