Chandigarh University Assistant Professor Interview Questions, Process, and Tips for Experienced

Automata is a mathematical model used to study computation and language.

• Automata theory deals with the study of abstract machines and their computational abilities.

• It is used to design and analyze algorithms and programming languages.

• Examples of automata include finite state machines, pushdown automata, and Turing machines.

Linear bounded automata are a type of Turing machine with a limited tape length.

• LBA is a restricted form of Turing machine

• The tape length of LBA is proportional to the input size

• LBA can solve problems in PSPACE complexity class

• Examples of LBA include parsing context-sensitive languages

An automata can be represented using a state diagram or a transition table.

• An automata can be represented using a state diagram which shows the states and transitions between them.

• Alternatively, it can be represented using a transition table which lists the current state, input symbol, and next state.

• For example, a finite state machine that recognizes the language of all strings over {0,1} that end with 01 can be repre...read more

I have published 3 papers in the last year.

• I have published 2 papers in peer-reviewed journals.

• One of my papers was presented at an international conference.

• My research focuses on the intersection of technology and society.