An algebraic characterization of strictly piecewise languages

Authors:
Jie Fu;Jeffrey Heinz;Herbert G. Tanner
Affiliations:
University of Delaware;University of Delaware;University of Delaware
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 5
Cited 2

Piecewise testable events

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An n log n algorithm for minimizing states in a finite automaton

An n log n algorithm for minimizing states in a finite automaton
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Automata Theory with Modern Applications

Automata Theory with Modern Applications
On languages piecewise testable in the strict sense

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language

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

Quantified Score

Hi-index	0.00

Visualization

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.