Theory of Automata: Construction of Symbolic Language

Published Date: 29 Mar 2018

• Rubina Naz & M Arslan Riaz

ABSTRACT:

Conventions for translating ordinary language statements into symbolic notation and many of places are use symbolic language for communication. And alphabet is a finite set of discriminatable and irreducible symbols that can be used either as such, or as representations of some other such set for communication. This abstracts and refines the linguistically idea of alphabet where the symbols map to sounds in a most highly contextual way, most especially in English, which because of its multilingual basis is rather unphonetic in a strict sense.

The first thing we are going to do is to learn the elements of this "new language". The second is to learn to translate ordinary language grammar into symbolic notation. The third thing is to consider arguments in this "new language."

Table of Contents (Jump to)

INTRODUCTION

OBJECTIVE OF THE WORK

Target Specifications

METHODOLOGY

SATES FOR AUTOMATA

REGULAR LANGUAGE

REGULAR EXPRESSION

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

Inputs with States

SATES FOR AUTOMATA

REGULAR LANGUAGE

REGULAR EXPRESSION

TRANSIATION TABLE

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Basic Hand Signals with inputs

Inputs with States

SATES FOR AUTOMATA

REGULAR LANGUAGE

REGULAR EXPRESSION

TRANSIATION TABLE

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Basic Hand Signals with inputs

Inputs with States

SATES FOR AUTOMATA

REGULAR LANGUAGE

REGULAR EXPRESSION

TRANSIATION TABLE

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Basic Hand Signals with inputs

Inputs with States

SATES FOR AUTOMATA

REGULAR LANGUAGE

REGULAR EXPRESSION

TRANSIATION TABLE

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

FEATURES OF A SYMBOLIC MODEL

List of tables (Jump to)

Table 1[1]:basic five signals

Table 2:Basic Hand Signals with inputs

Table 3:Inputs with States

Table 4:TRANSIATION TABLE

Table 5:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE(cntd….)

Table 6:Basic Hand Signals with inputs

Table 7:Inputs with States

Table 8:TRANSIATION TABLE

Table 9:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Table 10:Basic Hand Signals with inputs

Table 11:Inputs with States

Table 12:TRANSIATION TABLE

Table 13:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Table 14:Basic Hand Signals with inputs

Table 15:Inputs with States

Table 16:TRANSIATION TABLE

Table 17:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Table 18:Basic Hand Signals with inputs

Table 19:Inputs with States

Table 20:TRANSIATION TABLE

INTRODUCTION

The Symbolic Function of language is the mechanism by which meaning is attached to form. It is the pairing of form and meaning; the symbolic function is a sense-making utility that labels objects (referents) with “names” that map to a conceptualized meaning.

The Communicative Function of language is the means by which parties exchange notions of combined symbols in conventionalized ways to share conceptualizations in a relational way. This includes the ability to alter states of the world, to express internalizations, and to situate meaning in ad hoc frames that draw on world knowledge and encyclopedic knowledge.

These two functions interact in a number of ways, actual usage of symbols to communicate being one of those interactions – this may work to explain how idioms form, as the symbols are used in communication to attach meaning to a symbolic construction – entrenched usage normalizing the idiomatic construction into a common unit of communication.

Ideally, these tasks would be automated. Symbolic execution is a particularly successful technique for exploring multiple execution paths fully automatically. It has been used to communicate with particular words.

The sign language used by the Deaf Community in the UK is called British Sign Language (BSL). manual components, including hand shapes and movements, facial expression and body movements to express meaning, and can be used to express a full range of meaning.

What makes the difference issymbolic languagewhich makes significant cultural transmission feasible.

But the ideas, the imagination are triggering the century compiled collective knowledge and power in this symbolic language.

It was found that at a general level there are many commonalities in thesymbolic languageused in each country.

OBJECTIVE OF THE WORK

Main objective of this report is how a person can easily communicate and transfer their data or thought without knowing other person.

In the report with the help of automata particular engineers can recognized or may only of that person who are involve with them.

Target Specifications

Valid target languages for model specifications in symbolic language is help to achieve great way of communication and understanding way of talking.

The main target is to passing our thought with the help of symbols and transferring our massage easily

METHODOLOGY

Refers to communication that involves a shared message between the sender and the receiver. Examples of symbolic communication include speech, sign language, writing (print or Braille), picture communication systems, and tactile communication systems.

It could be said that everyone employs augmentative communication methods for much of the time. When holding a conversation we contribute to the meaning of the words used in many ways, including facial expression, gesture and body language, or by yawning. These additions can add to the meaning of the words used, or even reverse them completely

Symbol systems A variety of symbol systems are in common use. They have generally been developed to suit users and listeners who have difficulty with understanding written language, e.g. people with learning difficulties or young children. Systems can also be combined with individually designed symbols, objects and photographs if required.

Table 1[1]:basic five signals

You	Me	Watch to see	GO	I Understand

Table 2:Basic Hand Signals with inputs

Language	Inputs	symbols
You	a
Me	b
Watch or see	c
Go	d
I understand	e

 

Table 3:Inputs with States

A	B	C	D	E
1	2	3	4	5

SATES FOR AUTOMATA

Total states are required for making Automata for function and construction of symbolic language which are describing by the alphabets the initiation state is Q₀ which are connect to all (a,b,c,d,e)and final Q_f is also connect with all

The input a indicates the You

The input b indicates the Me

The input c indicates the Watch or see

The input d indicates the Go

The input e indicates the I understand

REGULAR LANGUAGE

L={a,b,c,d,e}*

REGULAR EXPRESSION

r.e=(ab,ac,ad,a….)

Table 4:TRANSIATION TABLE

δ*I	a	b	c	d	e
Qo	Q1	Q2	Q3	Q4	Q5
Q1	Q1Qf	â”´	â”´	â”´	â”´
Q2	â”´	Q1Qf	â”´	â”´	â”´
Q3	â”´	â”´	Q1Qf	â”´	â”´
Q4	â”´	â”´	â”´	Q1Qf	â”´
Q5	â”´	â”´	â”´	â”´	Q1Qf
Qf	â”´	â”´	â”´	â”´	â”´

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

Table 5:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE(cntd….)

Come	Listen	Hurry	Hold	Column formation

Table 6:Basic Hand Signals with inputs

Language	Inputs	symbols
Come	f
Listen	g
Hurry	h
Hold	i
Column formation	j

Table 7:Inputs with States

F	G	H	I	J
6	7	8	9	10

SATES FOR AUTOMATA

Total states are required for making Automata for function and construction of symbolic language which are describing by the alphabets the initiation state is Q₀ which are connect to all (f,g,h,i,j)and final Q_f is also connect with all

The input f indicates the Come

The input g indicates the Listen

The input h indicates the Hurry

The input i indicates the Hold

The input j indicates the Column Information

REGULAR LANGUAGE

L={f,g,h,I,j}*

REGULAR EXPRESSION

r.e=(ff,fg,fh,fi,fj,gh…….)

Table 8:TRANSIATION TABLE

δ*I	f	g	h	i	j
Qo	Q1	Q2	Q3	Q4	Q5
Q1	Q1Qf	â”´	â”´	â”´	â”´
Q2	â”´	Q1Qf	â”´	â”´	â”´
Q3	â”´	â”´	Q1Qf	â”´	â”´
Q4	â”´	â”´	â”´	Q1Qf	â”´
Q5	â”´	â”´	â”´	â”´	Q1Qf
Qf	â”´	â”´	â”´	â”´	â”´

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

Table 9:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Move Up	Hestage	Obstacle	Stop	Rally Point

Table 10:Basic Hand Signals with inputs

Language	Inputs	symbols
Move Up	k
Hestage	l
Obstacle	m
Stop	n
Rally Point	o

Table 11:Inputs with States

K	L	M	N	O
11	12	13	14	15

SATES FOR AUTOMATA

Total states are required for making Automata for function and construction of symbolic language which are describing by the alphabets the initiation state is Q₀ which are connect to all (k,l,m,n,o)and final Q_f is also connect with all

The input k indicates the Move Up

The input l indicates the Hestage

The input m indicates the Obstacle

The input n indicates the Stop

The input o indicates the Rally Point

REGULAR LANGUAGE

L={k,l,m,n,o}*

REGULAR EXPRESSION

r.e=(kk,kl,km,kn,ko,lm,ln….)

Table 12:TRANSIATION TABLE

δ*I	k	l	m	n	o
Qo	Q1	Q2	Q3	Q4	Q5
Q1	Q1Qf	â”´	â”´	â”´	â”´
Q2	â”´	Q1Qf	â”´	â”´	â”´
Q3	â”´	â”´	Q1Qf	â”´	â”´
Q4	â”´	â”´	â”´	Q1Qf	â”´
Q5	â”´	â”´	â”´	â”´	Q1Qf
Qf	â”´	â”´	â”´	â”´	â”´

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

Table 13:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Enemy	Sniper	Pistol	Riffle	shotgun

Table 14:Basic Hand Signals with inputs

Language	Inputs	symbols
Enemy	o
Sniper	p
Pestle	q
Riffle	r
Shot gun	s

Table 15:Inputs with States

P	Q	R	S	T
16	17	18	19	20

SATES FOR AUTOMATA

Total states are required for making Automata for function and construction of symbolic language which are describing by the alphabets the initiation state is Q₀ which are connect to all (p,q,r,s,t)and final Q_f is also connect with all

The input p indicates the Enemy

The input q indicates the Sniper

The input r indicates the Pistle

The input s indicates the Riffle

The input t indicates the Shotgun

REGULAR LANGUAGE

L={p,q,r,s,t}*

REGULAR EXPRESSION

r.e=(pp,pq,pr,ps,pt,qr…)

Table 16:TRANSIATION TABLE

δ*I	p	q	r	s	t
Qo	Q1	Q2	Q3	Q4	Q5
Q1	Q1Qf	â”´	â”´	â”´	â”´
Q2	â”´	Q1Qf	â”´	â”´	â”´
Q3	â”´	â”´	Q1Qf	â”´	â”´
Q4	â”´	â”´	â”´	Q1Qf	â”´
Q5	â”´	â”´	â”´	â”´	Q1Qf
Qf	â”´	â”´	â”´	â”´	â”´

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

Table 17:BASIC HAND SIGNALS INDICATES THE SYMBOLIC LANGUAGE (contd….)

Door	Window	Point at entry

Table 18:Basic Hand Signals with inputs

Language	Inputs	symbols
Door	u
Window	v
Point of entry	w

Table 19:Inputs with States

U	V	w
21	22	23

SATES FOR AUTOMATA

Total states are required for making Automata for function and construction of symbolic language which are describing by the alphabets the initiation state is Q₀ which are connect to all (u,v,w)and final Q_f is also connect with all

The input u indicates the Door

The input v indicates the Window

The input w indicates the Point to entry

REGULAR LANGUAGE

L={u,v,w}*

REGULAR EXPRESSION

r.e=(uu,uv,uw,uuw…)

Table 20:TRANSIATION TABLE

δ*I	u	v	w
Qo	Q1	Q2	Q3
Q1	Q1Qf	â”´	â”´
Q2	â”´	Q1Qf	â”´
Q3	â”´	â”´	Q1Qf
Qf	â”´	â”´	â”´

DFA MACHINE FOR CONSTRUCTION OF SYMBOLIC LANGUAGE

FEATURES OF A SYMBOLIC MODEL

• It contains a set of representations (or symbols) of something.
• It processes and manipulates those representations based on a set of rules programmed into the model.
• The rules operate on the representations according to their 'shape' or syntax, not according to what they represent (their semantics).

Let us take an example. The symbol '1' is character. In normal text, it represents the number one. When you read this text, you probably read it as a one. But this is a matter of interpretation, not a property of the symbol itself. For example, we could use the same symbol to represent the state of being 'on'. In fact, we do use it in this way on certain appliances — switches often have '0' and '1' marked on them to represent that the appliance is 'off' and 'on' respectively. The interpretation of the symbol (its semantics) is independent of the shape of the symbol (its syntax).

Symbolic models are extremely complicated, so it will serve us well to start from the very beginning: a Turing Machine. In the next few modules, we will explore symbolic models in their most primitive form. The simple machines we will consider model the processes of basic logic and arithmetic. The gap from modeling the process of arithmetic and grammar to the processes of thought is a large one, but it is one that many have thought bridgeable. In this module, we consider some of these thinkers, and how, if at all, we could test their bold hypothesis.

Portions of these modules are adapted from "Cognitive Modeling, Symbolic", by Whit Schonbein and William Bechtel; and "Symbolic vs Connectionist" by Chris Eliasmith and William Bechtel, both entries in theEncyclopedia of Cognitive Science(2000), Macmillan Reference Ltd.