April 2012
Intermediate to advanced
416 pages
10h 40m
English
Content preview from Theory of Computation
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
CHAPTER 4
ADDING A STACK TO A NFA: PUSHDOWN AUTOMATA
FA, and therefore NFA, accept some reasonably nontrivial languages over some alphabet ∑, yet they fail decisively on certain simple languages, such as L = {0n 1n : n ≥ 0} over Σ = {0, 1}, as we showed in 3.1.3.2. This language is an abstraction of a special case of “the set of strings of balanced brackets”,125 that is, LB = {(n)n: n ≥ 0} over A = {(,)}. Balanced brackets play an important role in the definition of syntax, and subsequently in the syntactic analysis of formulae, and of programming language constructs. In the latter domain, the result of 3.1.3.2, for example, makes it impossible for an automaton to recognize and pass string constants to the language translator of Algol 60. The reason is that such strings have a balanced bracket structure—where the brackets in this context are left and right quotes, “and”. This does not happen with other major programming languages that do not define strings this way.
In this chapter we will add slightly to the power of the NFA, without going all the way back to the full-fledged URM, so that languages such as L and LB are acceptable.
4.0.0.4 Remark. Translating the notation of 1.6.0.10 to grammar notation, we see at once that L = L(G), where G is the CFG over Σ = {0, 1} with just two rules:
That is, this language is context free (type-2).
We will see that the augmented NFA of ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.