Computational Phonology: A Constraint-Based Approach
Computational Phonology: A Constraint-Based Approach
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Efficient generation in primitive Optimality Theory
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
On languages piecewise testable in the strict sense
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
An algebraic characterization of strictly piecewise languages
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Journal of Logic, Language and Information
String extension learning using lattices
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which begin to describe such phenomena. Then this class is located within the Subregular Hierarchy (McNaughton and Papert, 1971). It is found that these languages contain the Strictly Local languages, are star-free, are incomparable with other known sub-star-free classes, and have other interesting properties.