Graph automata define symbol dynamics on graph structures, which has capability of generating structures in addition to state transition. The rules of the graph automata are unifo...
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Propagating scattered context grammars are used to generate their sentences together with their parses--that is, the sequences of labels denoting productions whose use lead to the ...
Rough Petri nets model (RPNM) for knowledge representation, rule generation, and reasoning is presented in this paper. An algorithm for verifying the consistency of a rough knowle...
The internal state of the Klimov–Shamir number generator TF-1 consists of four words of size w bits each, whereas its intended strength is 22w. We exploit an asymmetry in its out...