10 search results - page 1 / 2 » Canonical derivatives, partial derivatives and finite automa... |
TCS
2002
14 years 9 months ago
2002
DLT
2010
14 years 11 months ago
2010
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...
73
Voted
IJAC
2007
14 years 9 months ago
2007
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...
ACL
1998
14 years 11 months ago
1998
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...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
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...