Distributed Observability of Regular Languages is Undecidable

S. Tripakis

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M01/8

2001

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/Archive/ERL-01-8.pdf

BibTeX citation:

@techreport{Tripakis:M01/8,
    Author= {Tripakis, S.},
    Title= {Distributed Observability of Regular Languages is Undecidable},
    Year= {2001},
    Month= {Feb},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/3944.html},
    Number= {UCB/ERL M01/8},
}

EndNote citation:

%0 Report
%A Tripakis, S. 
%T Distributed Observability of Regular Languages is Undecidable
%I EECS Department, University of California, Berkeley
%D 2001
%@ UCB/ERL M01/8
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/3944.html
%F Tripakis:M01/8