Succinct representation of regular langu
โ
Ernst Leiss
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 346 KB
Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B