Clearing Restarting Automata

Peter Černo, František Mráz · Fundamenta Informaticae · 2010

Restarting automata were introduced as a model for analysis by reduction, which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automat

Read the paper · More papers on PaperTik