On languages piecewise testable in the strict sense

Authors:
James Rogers;Jeffrey Heinz;Gil Bailey;Matt Edlefsen;Molly Visscher;David Wellcome;Sean Wibel
Affiliations:
Dept. of Computer Science, Earlham College;Dept. of Linguistics and Cognitive Science, University of Delaware;Dept. of Computer Science, Earlham College;Dept. of Computer Science, Earlham College;Dept. of Computer Science, Earlham College;Dept. of Computer Science, Earlham College;Dept. of Computer Science, Earlham College
Venue:
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Year:
2007

Citing 8
Cited 7

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Piecewise testable events

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Piecewise and Local Threshold Testability of DFA

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Text classification using string kernels

The Journal of Machine Learning Research
Word sequence kernels

The Journal of Machine Learning Research
Kernel Methods for Pattern Analysis

Kernel Methods for Pattern Analysis
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Kernel methods for learning languages

Theoretical Computer Science

Estimating strictly piecewise distributions

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
String extension learning

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Maximum likelihood estimation of feature-based distributions

SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
Formal and empirical grammatical inference

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Tier-based strictly local constraints for phonology

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
An algebraic characterization of strictly piecewise languages

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Learning in the limit with lattice-structured hypothesis spaces

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explore the class of Strictly Piecewise languages, originally introduced to characterize long-distance phonotactic patterns by Heinz [7] as the Precedence Languages. We provide a series of equivalent abstract characterizations, discuss their basic properties, locate them relative to other well-known subregular classes and provide algorithms for translating between the grammars defined here and finite state automata as well as an algorithm for deciding whether a regular language is Strictly Piecewise.