The representation of context-free languages in automata with a push-down type store

Cybernetics ◽  
1965 ◽  
Vol 1 (2) ◽  
pp. 81-86 ◽  
Author(s):  
A. A. Letichevskii
Keyword(s):  
Push Down ◽  
Context Free

scholarly journals Learning TOC - Begins

2018 ◽  
pp. 255-260
Author(s):  
Vishal Prajapati ◽  
Shivani Champaneri ◽  
Rahul Dhamecha ◽  
Janvi Sindha ◽  
Dr. Sheshang Degadwala
Keyword(s):  
Computer Science ◽  
Web Application ◽  
Regular Expression ◽  
Finite Automata ◽  
Theory Of Computation ◽  
Science Field ◽  
Context Free Grammar ◽  
Fundamental Reason ◽  
Push Down ◽  
Context Free

Learning TOC – begins is a web application which is useful for Learning TOC (Theory of Computation). It covers hypothesis of the basic points with cases and it likewise has Exercise segment in which client can check different speculations for all intents and purposes. It likewise creates drawing of different cases. So the client can learn it adequately and additionally quick. Client can build FA of the string without anyone else and print or fare it for his task work. It has the office of Test to check his score and readiness work. So it is extremely valuable for client as exam arrangement. This Web Application is valuable for the educators and understudies and additionally different clients which are has a place with the Computer Science field. The fundamental reason for this web application is to pick up everything outwardly and graphically. It covers the listed topics given below- Regular Expression, Finite Automata, Context Free Grammar, Push Down Automata, Turing Machine, Exercise of the topics, Mock test.

Push-Down Automata and Context-Free Languages

2011 ◽  
pp. 101-124
Author(s):  
Yunlin Su ◽  
Song Y. Yan
Keyword(s):  
Push Down ◽  
Context Free

Computations in Coordinated Pair Systems

1986 ◽  
Vol 9 (4) ◽  
pp. 455-480
Author(s):  
A. Ehrenfeucht ◽  
H.J. Hoogeboom ◽  
G. Rozenberg
Keyword(s):  
General Framework ◽  
Formal Language ◽  
Formal Language Theory ◽  
Language Theory ◽  
Selective Substitution ◽  
Push Down ◽  
Context Free ◽  
Natural Way

Selective substitution grammars provide a rather general framework for the grammatically oriented formal language theory (see, e.g., [R1], [K], and [KR]). They were generalized in [R2] to coordinated table selective substitution systems (ds systems) which provide a convenient unifying framework for both grammars and machines (automata). The present paper investigates coordinated pair (cp) systems which form a subclass of cts systems corresponding in a very natural way to push-down automata: thus cp systems generate context-free languages (all and only). This paper investigates the structure of computations in cp systems.

Deterministic Context-Free Dynamic Logic Is More Expressive than Deterministic Dynamic Logic of Regular Programs1

1987 ◽  
Vol 10 (2) ◽  
pp. 123-141
Author(s):  
Pawel Urzyczyn
Keyword(s):  
Dynamic Logic ◽  
Flow Chart ◽  
Deterministic Dynamic ◽  
Push Down ◽  
Context Free ◽  
Free Dynamic

We show an example of an algebra T∙, such that every flow-chart program is equivalent in T∙ to a loop-free approximation of itself, while a program augmented by one binary push-down store is not equivalent in T∙ to any loop-free program. From this we deduce that the Deterministic Dynamic Logic of regular programs is strictly weaker than the Deterministic Context-Free Dynamic Logic.

Syntactic analysis of context-free (CF) languages using nondeterministic push-down automata

Cybernetics ◽  
1975 ◽  
Vol 10 (3) ◽  
pp. 458-467
Author(s):  
A. Sh. Nepomnyashchaya
Keyword(s):  
Syntactic Analysis ◽  
Push Down ◽  
Context Free
Sign in / Sign up

Export Citation Format

Share Document