2604 search results - page 164 / 521 » General constant expressions for system programming language... |
114
Voted
CORR
2009
Springer
15 years 1 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
140
Voted
ALC
1997
15 years 5 months ago
1997
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...
137
Voted
SIGCOMM
2003
ACM
15 years 9 months ago
2003
ACM
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
121
Voted
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
113
Voted
ICLP
1994
Springer
15 years 7 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...