SIGN IN
SIGN UP
A characterization of regular expressions under bisimulation
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
J. C. M. Baeten
Technische Universiteit Eindhoven, Eindhoven, The Netherlands
F. Corradini
Università di Camerino, Camerino, Italy
C. A. Grabmayer
Vrije Universiteit, Amsterdam, The Netherlands
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 54 Issue 2, April 2007
Article No. 6
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1219092.1219094
2007 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 35
· Downloads (cumulative): 749
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
automata
bisimulation equivalence
interactive and reactive computation
regular expressions
relations between models
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder