The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
113 views
$L=\left \{ a^{n}b^{n}c^{n}d^{n} | n<10^{10} \right \}$

I know this language is regular language so it is DCFL AND CFL also

but how can we implenment this language with DCFL with stack because till we reach c there will be nothing in the stack to compare c with

this language can be implemented using FA We can have these many states to compare how we will compare in stack

explain the logic of this language with DCFL
asked in Theory of Computation by (211 points)
retagged by | 113 views
+1
PDA is just a Finite Automata with an unbounded stack.
I think there is no need to use a stack for this language. As language is finite, keeping track of symbols with the help of states is the only solution.

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,540 questions
54,099 answers
187,269 comments
71,006 users