28
enters, it has a certain probability of writing down a symbol. In the figure, the symbols are the
capital letters. The result is that the machine writes a string of symbols, a formula, e.g. NNSG.
FIGURE 1. Schematic illustration of a finite-state automaton. Numbers represent machine
states. Letters represent what the machine inscribes. The machine corresponds to a grammar
capable of producing an infinite number of formulae such as SXXSXG. This infinity is owing to
iterative recursion but not embedding, and hence cannot do justice to the syntax of any natural
language. Reproduced from Miller (1969: 131).
Chomsky devised the notion of a finite-state automaton or grammar to show how hopeless
it is for explaining natural-language syntax (1956). We can think of a finite-state automaton as
embodying rules for producing sentences. Such rules can be understood as instructions given to
an automaton governing its transition from one state to the next. If the automaton is in a state
More intriguing information
1. Innovation and business performance - a provisional multi-regional analysis2. Cultural Neuroeconomics of Intertemporal Choice
3. Why unwinding preferences is not the same as liberalisation: the case of sugar
4. Real Exchange Rate Misalignment: Prelude to Crisis?
5. Towards Teaching a Robot to Count Objects
6. Antidote Stocking at Hospitals in North Palestine
7. The name is absent
8. Public-Private Partnerships in Urban Development in the United States
9. The geography of collaborative knowledge production: entropy techniques and results for the European Union
10. Demographic Features, Beliefs And Socio-Psychological Impact Of Acne Vulgaris Among Its Sufferers In Two Towns In Nigeria