Formal Grammar

The class of mildly context-sensitive languages is commonly regarded as sufficiently rich to capture most aspects of the syntax of natural languages. Many formalisms are known to generate families of languages which belong to this class. Among them are tree-adjoining grammars, multiple context-free grammars and abstract categorial grammars. All these formalisms have in common that they are based on operations which do not copy already derived material in the course of a derivation. We propose an extension of the class of languages captured by these formalisms that is arguably mildly context-sensitive. This extension is based on a mild use of a copying operation we call IO-substitution.

[1]  Berthold Crysmann,et al.  An inflectional approach to Hausa Final Vowel Shortening , 2005 .

[2]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[3]  Molly Visscher,et al.  Deciding Strictly Local ( SL ) Languages , 2008 .

[4]  Aarne Ranta.  Type-Theoretical Grammar , 1995 .

[5]  James Rogers,et al.  On Languages Piecewise Testable in the Strict Sense , 2007, MOL.

[6]  Enrique Vidal,et al.  Learning Locally Testable Languages in the Strict Sense , 1990, ALT.

[7]  Dan Flickinger,et al.  Minimal Recursion Semantics: An Introduction , 2005 .

[8]  Jeffrey Heinz,et al.  Sentence and Word Complexity , 2011, Science.

[9]  Imre Simon,et al.  Piecewise testable events , 1975, Automata Theory and Formal Languages.

[10]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[11]  Marcus Kracht,et al.  The mathematics of language , 2003 .

[12]  Rob Goedemans,et al.  A survey of word accentual patterns in the languages of the world , 2010 .

[13]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[14]  B. Hayes.  Metrical Stress Theory: Principles and Case Studies , 1995 .

[15]  Jeffrey Heinz.  Learning Long-Distance Phonotactics , 2010, Linguistic Inquiry.

[16]  Jeffrey Heinz.  On the role of locality in learning stress patterns* , 2009, Phonology.

[17]  Karl Magnus Petersson,et al.  Artificial Language Learning in Adults and Children , 2010 .

[18]  Larry M. Hyman.  DRAFTTo be submitted to Language Sciences How (not) to do Phonological Typology: The Case of Pitch-Accent , 2009 .

[19]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[20]  Aarne Ranta,et al.  Constructing possible worlds , 2008 .

[21]  T. Graf.  Comparing Incomparable Frameworks: A Model Theoretic Approach to Phonology , 2010 .

[22]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[23]  Laurice Anne Tuller,et al.  Bijective relations in universal grammar and the syntax of Hausa , 1986 .

[24]  Russell G. Schuh,et al.  THE FUNCTIONAL UNITY OF THE HAUSA AND WEST CHADIC SUBJUNCTIVE , 2003 .

[25]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[26]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[27]  Pedro Garc ´ õa.  Learning k-Testable and k-Piecewise Testable Languages from Positive Data , 2004 .

[28]  Noam Chomsky,et al.  The faculty of language: what is it, who has it, and how did it evolve? , 2002, Science.

[29]  Jeffrey Heinz,et al.  Inductive learning of phonotactic patterns , 2007 .