12.07.2015 Views

The Use of Formal Language Theory in Studies of Artificial - CiteSeerX

The Use of Formal Language Theory in Studies of Artificial - CiteSeerX

The Use of Formal Language Theory in Studies of Artificial - CiteSeerX

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4 <strong>The</strong> expression |w| denotes the length <strong>of</strong> the str<strong>in</strong>g w—the number <strong>of</strong> symbols it conta<strong>in</strong>s.<strong>The</strong> expression |w| Adenotes the number <strong>of</strong> As it conta<strong>in</strong>s.5 <strong>The</strong>se two examples are due to Ge<strong>of</strong>frey K. Pullum.6 Pump<strong>in</strong>g lemmas establish certa<strong>in</strong> types <strong>of</strong> closure properties <strong>of</strong> str<strong>in</strong>gsets: if a str<strong>in</strong>gset<strong>in</strong>cludes str<strong>in</strong>gs with length exceed<strong>in</strong>g an arbitrary but fixed bound then it also <strong>in</strong>cludes str<strong>in</strong>gs<strong>in</strong> which certa<strong>in</strong> substr<strong>in</strong>gs are repeated arbitrarily many times. Shieber (1985) and Huybregts(1984) employed results <strong>of</strong> this sort to show that certa<strong>in</strong> dialects <strong>of</strong> Swiss-German are notrepresentable as Context Free str<strong>in</strong>gsets.7 <strong>The</strong>se characterize the structure <strong>of</strong> str<strong>in</strong>gsets <strong>in</strong> terms <strong>of</strong> the way <strong>in</strong> which certa<strong>in</strong> relationson str<strong>in</strong>gs, which depend on the str<strong>in</strong>gset, partition the set <strong>of</strong> all str<strong>in</strong>gs <strong>in</strong>to equivalenceclasses.8 We provide concrete examples <strong>of</strong> what we mean by “nature <strong>of</strong> the <strong>in</strong>formation” as wesurvey a range <strong>of</strong> descriptive classes <strong>in</strong> the next section.9 It is easy to translate an SL k description <strong>in</strong>to a k-expression def<strong>in</strong><strong>in</strong>g the same str<strong>in</strong>gset,so LT k is a strict superclass <strong>of</strong> SL k .10 Aga<strong>in</strong>, k-expressions can be easily translated <strong>in</strong>to FO(+1) formulae; so FO(+1) is a strictsuperclass <strong>of</strong> LT.11 A F<strong>in</strong>ite State automaton recognizes an FO(

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!