We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
— Euler diagrams are often used to visualize intersecting data sets in applications such as criminology; genetics, medicine and computer file systems. One interesting aspect of t...