The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
Mark Seligman, Christian Boitet, Boubaker Meddeb-H...
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...