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. Measuring and Testing Advertising-Induced Rotation in the Demand Curve2. Dual Track Reforms: With and Without Losers
3. Are combination forecasts of S&P 500 volatility statistically superior?
4. A COMPARATIVE STUDY OF ALTERNATIVE ECONOMETRIC PACKAGES: AN APPLICATION TO ITALIAN DEPOSIT INTEREST RATES
5. ISSUES IN NONMARKET VALUATION AND POLICY APPLICATION: A RETROSPECTIVE GLANCE
6. The name is absent
7. Wage mobility, Job mobility and Spatial mobility in the Portuguese economy
8. How does an infant acquire the ability of joint attention?: A Constructive Approach
9. Transport system as an element of sustainable economic growth in the tourist region
10. The name is absent