Abstract
A family of languages is called mildly context-sensitive if
-
it includes the family of all ε-free context-free languages;
-
it contains the languages
-
{ a n b n c n : n ≥ 1 } – multiple agreement,
-
{ a m b n c m d n : m,n ≥ 1 } – crossed dependencies, and
-
{ ww : w ∈ Σ + } – reduplication;
-
-
all its languages are semi-linear; and
-
their membership problem is decidable in polynomial time.
In our paper we introduce a new model of computation called buffer augmented pregroup grammars that defines a family of mildly context-sensitive languages. This model of computation is an extension of Lambek pregroup grammars with a variable symbol – the (buffer) and is allowed to make an arbitrary substitution from the original pregroup to the variable. This increases the pregroup grammar generation power, but still retains the desired properties of mildly context-sensitive languages such as semi-linearity and polynomial parsing. We establish a strict hierarchy within the family of mildly context-sensitive languages defined by buffer augmented pregroup grammars. In this hierarchy, the hierarchy level of the family language depends on the allowed number of occurrences of the variable in lexical category assignments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aizikowitz, T., Francez, N., Genkin, D., Kaminski, M.: Extending free pregroups with lower bounds. Studia Logica (to appear)
Buszkowski, W.: Lambek grammars based on pregroups. In: Groote, P.D., Morrill, G., Retorè, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 95–109. Springer, Heidelberg (2001)
Buszkowski, W., Moroz, K.: Pregroup grammars and context-free grammars. In: Pre-proceedings of the international workshop on non-classical formal languages in linguistics, Tarragona, Spain, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili (2007)
Francez, N., Kaminski, M.: Commutation-extended pregroup grammars and mildly context-sensitive languages. Studia Logica 87, 295–321 (2007)
Francez, N., Kaminski, M.: Commutation-augmented pregroup grammars and push-down automaton with cancellation. Information and Computation 206, 1018–1032 (2008)
Hopcroft, J., Ullman, J.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
Lambek, J.: Type grammars revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 1–27. Springer, Heidelberg (1999)
Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 329–345. Springer, Heidelberg (1997)
Vijay-Shanker, K., Weir, D.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27(6), 511–546 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Genkin, D., Francez, N., Kaminski, M. (2010). Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars. In: Manna, Z., Peled, D.A. (eds) Time for Verification. Lecture Notes in Computer Science, vol 6200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13754-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-13754-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13753-2
Online ISBN: 978-3-642-13754-9
eBook Packages: Computer ScienceComputer Science (R0)