Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
Masanori Bando, N. Sertac Artan, Nishit Mehta, Yi ...
The theory of supervisory control of discrete event systems is extended to the real-time setting. The real-time behavior of a system is represented by the set of all possible time...