A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
Information extraction is concerned with applying natural language processing to automatically extract the essential details from text documents. A great disadvantage of current ap...
Although testing is central to debugging and software certification, there is no adequate language to specify test suites over source code. Such a language should be simple and c...
Andreas Holzer, Christian Schallhart, Michael Taut...