Review: \(a^nb^n\) (\(oysters^neat^n\), \(people^nmove^n\))

Review Exercises

Context Free Grammars and Pushdown Automata


Now we'll see how we can describe stress patterns using rewrite grammars.

Grammars/finite state acceptors for stress patterns

  1. How would you write a grammar/FSA that yields the following stress pattern (Afrikaans):

    In words of all sizes, primary stress falls on the initial syllable.

  2. How would you write a grammar/FSA that yields the following stress pattern? First try writing a grammar for just secondary stress, before doing both primary and secondary stress together. (Asmat)

    In words of all sizes, primary stress falls on the initial syllable. In words of all sizes, secondary stress falls iteratively on odd numbered syllables, counting from the right.

  3. How would you write a grammar/FSA that yields the following stress pattern? (Fijian)

    In words of all sizes, primary stress falls on the final syllable if it is heavy, else on the penultimate syllable if it is heavy, else on the penultimate syllable. In words of all sizes, secondary stress falls on all heavy syllables. In sequences of light syllables, secondary stress falls on the even numbered syllables, counting from the right edge of the sequence. Light monosyllables do not occur.

Some points to consider

  1. Counting: Heinz (2011)

    Many regular languages describe unnatural phonological patterns. For example, imagine the logically possible language in which words are well-formed only if they contain an even number of vowels, regardless of their order. Words like bbb,baba, bbaa, aab, bbaabbb are all well-formed according to this pattern, unlike words like a, ababa, bab, bababab. This pattern is a regular language, though most phonologists would agree natural languages do not contain bonafide phonological generalizations of this sort (nor could natural languages do so).

  2. Definitions (see further-reading/formal_language/heinzhiguerazaanen2016.pdf)

    1. Deterministic acceptor: a finite state acceptor with a uniqe initial state, and where, given current state and next symbol, (output and) next state is (either undefined or) unique.
      • an FSA can be forward-deterministic and/or reverse/backward-deterministic (Section 2.3.1, page 31). If people just say deterministic, they mean forward-deterministic
    2. Canonical acceptor for some language: minimal (fewest states), deterministic acceptor for some language (section 3.3, page 53)

    3. Tails, heads, head vs. tail canonical acceptors, left to right and right to left

  3. StressTyp2 database

  4. Strings vs. trees


Implementing (finite state) phonology: rules and constraints

Mans Hulden Finnish example