205 search results - page 11 / 41 » Testing the Equivalence of Regular Languages |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
CASCON
2006
14 years 10 months ago
2006
In this paper we present a test-driven approach to porting code from one object-oriented language to another. We derive an order for the porting of the code, along with a testing ...
100
click to vote
ACL
1992
14 years 10 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
LICS
2008
IEEE
15 years 3 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
WIA
2009
Springer
15 years 4 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...