Published 2007
| Version Published
Book Section - Chapter
Open
Solving Commutative Relaxations of Word Problems
Creators
-
1.
California Institute of Technology
-
2.
Massachusetts Institute of Technology
Abstract
We present an algebraic characterization of the standard commutative relaxation of the word problem in terms of a polynomial equality. We then consider a variant of the commutative word problem, referred to as the "Zero-to-All reachability" problem. We show that this problem is equivalent to a finite number of commutative word problems, and we use this insight to derive necessary conditions for Zero-to-All reachability. We conclude with a set of illustrative examples.
Additional Information
© 2007 IEEE. Issue Date: 12-14 Dec. 2007; Date of Current Version: 21 January 2008. This research was supported by AFOSR MURI grant #102-108-0673.Attached Files
Published - Tarraf2007p8396Proceedings_Of_The_46Th_Ieee_Conference_On_Decision_And_Control_Vols_1-14.pdf
Files
Tarraf2007p8396Proceedings_Of_The_46Th_Ieee_Conference_On_Decision_And_Control_Vols_1-14.pdf
Additional details
Identifiers
- Eprint ID
- 20421
- Resolver ID
- CaltechAUTHORS:20101013-121426898
Funding
- Air Force Office of Scientific Research Multidisciplinary Research Initiative (AFOSR-MURI)
- 102-108-0673
Dates
- Created
-
2010-10-14Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
Caltech Custom Metadata
- Series Name
- Proceedings IEEE Conference on Decision and Control
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9886111