Automata on Guarded Strings and Applications


Guarded strings are like ordinary strings over a finite alphabet P, except that atoms of the free Boolean algebra on a set of atomic tests B alternate with the symbols of P. The regular sets of guarded strings play the same role in Kleene algebra with tests as the regular sets of ordinary strings do in Kleene algebra. In this paper we develop the elementary… (More)


2 Figures and Tables


Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.