DMCA
An algebraic characterization of strictly piecewise languages (2011)
Cached
Download Links
| Venue: | In The 8th Annual Conference on Theory and Applications of Models of Computation |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Fu11analgebraic,
author = {Jie Fu and Jeffrey Heinz and Herbert G. Tanner},
title = {An algebraic characterization of strictly piecewise languages},
booktitle = {In The 8th Annual Conference on Theory and Applications of Models of Computation},
year = {2011},
publisher = {SpringerVerlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper provides an algebraic characterization of the Strictly Piecewise class of languages studied by Rogers et al. 2010. These language are a natural subclass of the Piecewise Testable languages (Simon 1975) and are relevant to natural language. The algebraic characterization highlights a similarity between the Strictly Piecewise and Strictly Local languages, and also leads to a procedure which can decide whether a regular language L is Strictly Piecewise in polynomial time in the size of the syntactic monoid for L. 1
