0% found this document useful (0 votes)
13 views6 pages

Priyanjana Ghosh - Automata

This technical report discusses the categorization of languages in automata, focusing on Turing machines and their classifications based on tape movement and operations. It explores various types of automata, including acceptors and transducers, and their corresponding grammars, such as regular, context-free, and contextual grammars. The report concludes by highlighting the application of automata in real-world systems and their ability to adapt to external inputs.

Uploaded by

Priyanjana Ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views6 pages

Priyanjana Ghosh - Automata

This technical report discusses the categorization of languages in automata, focusing on Turing machines and their classifications based on tape movement and operations. It explores various types of automata, including acceptors and transducers, and their corresponding grammars, such as regular, context-free, and contextual grammars. The report concludes by highlighting the application of automata in real-world systems and their ability to adapt to external inputs.

Uploaded by

Priyanjana Ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CATEGORISATION OF LANGUAGES IN AUTOMATA

TECHNICAL REPORT WRITING FOR CA#2 EXAMINATION


Topic: CATEGORISATION OF LANGUAGES IN AUTOMATA
Paper Name: FORMAL LANGUAGE AND AUTOMATA
THEORY
Paper Code: PCC CS 403
Name: PRIYANJANA GHOSH
Roll Number: 18700121027
Stream: COMPUTER SCIENCE ENGINEERING
Year: 2nd
Semester: 4th
Section: A
Date of Submission: 13th March 2023
INTRODUCTION
All automata referred to from this point forward can be essentially understood as Turing
machines, which are classified according to the number, length and movement of tapes and
the read and write operations used. The term discrete state machine is sometimes used to
emphasize the discrete nature of the internal state. The main classes are sensors and receivers.
In automata theory, a converter is an automaton with an input and an output; any Turing
machine for computing a partially recursive function can serve as an example, as stated
earlier. An acceptor is an automaton with no output, in the particular sense that it recognizes
or accepts words of the machine alphabet. The acceptor input is written to the tape in the
usual way, but at the end of the computation the tape is empty and acceptance of the input
word is indicated by a special condition called the end condition. Thus, a word x, or a
sequence of symbols of the alphabet designated by the letter S, is said to be accepted by an
acceptor A which calculates A, starting at the initial state q0 with x on the tape, and s'
stopping at the final state with a completely empty band. If there exists an automaton A
which accepts any word x ∊ U, then a subset U representing the set S* of words of the
alphabet S is called the accepted set.

ANALYSIS
A fundamental result of automata theory is that any recursively additive set, or sequence of
partially recursive functions, is an accepting set. Typically, the receiver is a bidirectional
unbounded tape automaton. A useful taxonomy of receptors associated with generative
grammar theory developed by American linguist Noam Chomsky. Generative grammar is a
system of analysis that is often the same as linguistics. In this way, a language can be thought
of as a finite set of rules that can produce sentences. In the context of linguistics or automata
theory, the use of generative grammar is the whole of generating and describing the
grammatical structures of natural languages or automata-oriented languages. A simple
grammar of English fragments defined by the 12 rules can be used to introduce the main
ideas. In this simple grammar, each line is of the form g → g' (read "g' replaces g"), which
means that g' can be rewritten as g in a string of symbols. The symbol S appearing in the
rules can be understood as representing the grammatical category "sentence", Pr representing
"pronoun", VP representing "verb phrase", NP representing "nominal phrase" and so on.
Symbols marked with a hyphen (-) form the set VN of non-terminals.The English expression
"she" etc. appearing in the line constitutes the terminal set VT. S is the initial symbol.

English sentences beginning with S can be deduced by applying rules. The derivation starts w
ith S, the first line allows rewriting Pr VP for S, which gives Pr VP, the fourth line allows rew
riting V NP to VP, which gives Pr V NP, etc. (see 8). The last step produces the terminal strin
g or phrase; it consists solely of elements of the terminal vocabulary VT. No rules apply, so n
o further steps are possible.

The set of sentences generated by a grammar is called a language.


Beyond trivial examples, grammars have spawned an infinite number of languages.

Recursively summable grammars and Turing acceptors


As noted above, a fundamental consequence of automata theory is that any recursively summ
able set forms an accepting set. Typically, the receiver is a bidirectional unbounded tape auto
maton. On the other hand, a grammar consisting of rules g → g', where g and g' are arbitrary
words of (VT ∪ VN)*, is an unlimited rewriting system, and any recursively summable set of
words is to say, language in the present sense, is produced by such a system. These very gen
eral grammars therefore correspond to bidirectional acceptors, called Turing acceptors, which
accept recursively summable sets.
Finite state syntax and finite state acceptors
An acceptor that moves the strip to the left, reads symbol by symbol, and removes while is th
e simplest finite state acceptor. These automata have exactly the same capabilities as McCull
och-Pitts automata and accept so
called regular sets. The corresponding grammars in the taxonomy in question are finite state g
rammars.
In these systems, the rule g → g' is restricted so that g is a non-
terminal v of VN (as shown above) and g' is of the form us, u ∊ VN, and s ∊ VT. Languages
generated by finite state grammars are called regular languages
because of this correspondence.
Although these simple grammars and receivers have some significance in information theory
and neural network modeling, they are not descriptive enough for English or standard comput
er languages like Algol because they cannot consider sentence structure. In particular, finite-
state grammars cannot generate self-
integrating sentences such as "The man who bit the dog ran away" or multi-
read sentences such as "She was a pretty little girl".

Context-free grammars and pushdown acceptors

A context-free or sentence-
structured grammar, while obviously not providing a fully adequate description of a dialect, d
oes have the desired properties just mentioned. For this family, the rule g → g' contains a sing
le left non-terminal, as in the case of finite-
state grammars, but allows g' to be any word in (VT ∪ VN)*. The example discussed above is
a context-
free grammar. This grammar takes into account the structure and ambiguity of sentences (see
9).
The
stack acceptor, which plays a key role in computer programming theory, is an automaton corr
esponding to a context-free grammar.
A fingerprint receiver is a finite state receiver equipped with an additional bidirectional stora
ge band, called fingerprint memory. At the start of the operation, the tape is empty. Stores the
syntactic structure used to parse the sentence being read during the automaton calculation. St
orage moves left when pressed and can only read the last symbol pressed, then the next after t
he last, and so on. If both the input and storage tapes are empty when the automaton halts in t
he final (one-way) state, then the input is accepted.

The quadruple representation of the Turing machine can be replaced here by a clearer list of r
ules that model the action of the band in its application. Rules can be formulated for a hash ac
ceptor P of a context-free language L of terms xcx-
1, where x is a word of the abstract alphabet {a, b} and x-
1 is the inversion of x . The first of these rules can be stated as follows, if P is in state q0 and
scans a on the input and stores any (defined) symbol on the printout, it shifts the strip to the le
ft, removes a from l 'enter and store a on pressure Delete a and enter state q1. The symbolic e
xpression of the rule can be: q0a → aq1. Another rule could be of the following form: if P is i
n state q1 scanning c in input and everything in memory, it shifts the input to the left, clears c
and does nothing with the memory - in in short, q1c → q2.
Another requirement is that if P in q2 finds a in the input and a in the store, then it shifts the i
nput left, deletes a, shifts the store right, and deletes a (see 10). An example can easily be con
structed to show that under certain rules a set such as abcba is accepted (see 11). If q0abcba
marks the start of the computation, the initial state q0 searches for the first a in abcba on the i
nput tape and empties it on the storage tape, and if q2 is the final state, the computation is det
ermined by the rules data above (see 10) Computation At the end, the automaton is in the fina
l state q2, the two strips are empty, and there are no q2 rules alone on the left, P stops, so abc
ba is accepted.

Thinking about this and other easy-to-


build examples shows that impression receivers are actually able to parse sentences from cont
ext-free languages.

Contextual grammars and linear bounded acceptors


A fourth type of acceptor, of mainly mathematical rather than applied interest, is a bidirection
al bounded-
band acceptor, that is, a band whose length is never a function linear of the input length. They
are bounded linear receivers. They correspond to the contextual grammars of the current clas
sification scheme.
Unlike context-free grammars, the latter systems use the rule g → g', where the non-
terminal ν ∊ VN of g can only be rewritten in the context xwy; thus g → g′ is of the form xvy
→ xwy, x, y, w ∊ (VT ∪ VN)*. An example of a contextual language accepted by linear boun
ded automata is the xcx replication language.

The family of recursively enumerable languages


includes contextual languages, which in turn include contextless languages, and finally regula
r or finite state languages. Other hierarchies of the corresponding receptors have not been stu
died in depth.

Finite transducers
The most important transducers are finite transducers or sequential machines, which can be d
escribed as one-way Turing machines with outputs.
These are the least powerful in terms of computing power, while general-
purpose machines are the most powerful. There are also mid-power transducers.

Algebraic definition

Because the frequency band and the output are unidirectional, a finite sensor T can be thought
of as a "black box" with an input coming from the right and an output coming from the left.
Therefore, T can be thought of as a quintuplet • S, Q, O, M, NÒ, where S, Q and O are non-
empty finite sets of inputs, states and outputs, respectively, and M is a function of the product
Q × S in Q and N is a function on the same domain as in O. The values
are denoted by the usual function notation M(q, s) and N(q, s), s ∊ S and q ∊ Q M and N can
be extended to the domain Q × S by the four relations.

Classification according to semigroups


A mathematically significant classification of transducers can be obtained according to the th
eory of semigroups. In general, if the transducer T is reduced, for a fixed input, the function ϕ
s given by M as a map from the state space Q to the state space forms a semigroup, called the
semigroup of T (see 14). With certain procedures, these semigroups and their associated trans
ducers T can be decomposed into more fundamental systems called series and parallel transd
ucers. To clarify, the next state (from state qa, qb in the cascade machine TA → TB is a state
pair consisting of the next state in TA of qa with input s and state following in TB with the in
put Na of qb The state (qa, s) -
the latter being the output of Ta (see 15) can schematically describe the connection, showing
that in a series connection the output of TA is l entry of TB.

Postal machine
The type of automaton studied is structurally different from the Turing machines, but is identi
cal in computing power. Mathematician E.L. Mail (USA) in 1936 proposed an automaton (or
algorithm) which is a pair of finite sequences •1, a1Ò, •2, a2Ò, ···, •m, amÒ, such that ai is ei
ther the two associated moves The band command is a right or left square, a command to prin
t symbols, including spaces, limited alphabets, or integers. The post office starts at 1, obeys th
e instruction an in step n, then goes to step n + 1, unless an is an integer m, in which case it g
oes to step n if the swept square at n is marked m steps , or go to step n+1 if this box is empty
. The postal machine was the prototype of a programming scheme developed 10 years later b
y von Neumann and his collaborators. For any partially recursive function, it is possible to fin
d a Post machine capable of computing it.

CONCLUSION
More general automata are designed to respond to changes in external conditions or other inp
uts. For example, controlling thermostats, autopilots, missile guidance systems, telephone net
works, and some types of escalators are all forms of automata.
The internal state of such devices is determined not only by their initial state, as in the case of
pendulum clocks, but can be determined by a human operator, by input from another automa
ton, or by an event or a series of events in the environment. For example, a thermostat has an
"on" or "off" state depending on the temperature. The best-known general-
purpose automata are modern electronic computers whose internal state is determined by data
input and produces a certain output.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy