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.
This research is supported by grant #1035577 from the National Science Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anderson, J.A.: Automata Theory with Modern Applications. Cambridge University Press, Cambridge (2006)
Clifford, A.: The Algebraic Theory of Semigroups. American Mathematical Society, Providence (1967)
García, P., Ruiz, J.: Learning k-testable and k-piecewise testable languages from positive data. Grammars 7, 125–140 (2004)
Green, J.A.: On the structure of semigroups. The Annals of Mathematics 54(1), 163–172 (1951)
Haines, L.H.: On free moniods partially ordered by embedding. Journal of Combinatorial Theory 6, 94–98 (1969)
Heinz, J.: Learning long-distance phonotactics. Linguistic Inquiry 41(4), 623–661 (2010)
Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society 3(2), 326–336 (1952)
Holzer, M., König, B.: Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin 83, 139–155 (2004)
Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Tech. rep., Stanford, CA, USA (1971)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Pin, J.É.: Syntactic Semigroups. In: Rozenberg, G., Salomaa, A. (eds.), vol. 1, Springer, Heidelberg (1997)
Rogers, J., Heinz, J., Bailey, G., Edlefsen, M., Visscher, M., Wellcome, D., Wibel, S.: On languages piecewise testable in the strict sense. In: Ebert, C., Jäger, G., Michaelis, J. (eds.) MOL 10. LNCS, vol. 6149, pp. 255–265. Springer, Heidelberg (2010)
Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Thierrin, G.: Convex languages. In: ICALP 1972. pp. 481–492 (1972)
Watanabe, T., Nakamura, A.: On the transformation semigroups of finite automata. Journal of Computer and System Sciences 26(1), 107–138 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, J., Heinz, J., Tanner, H.G. (2011). An Algebraic Characterization of Strictly Piecewise Languages. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-20877-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20876-8
Online ISBN: 978-3-642-20877-5
eBook Packages: Computer ScienceComputer Science (R0)