Capacity Bounded Grammars and Petri Nets

Details Capacity Bounded Grammars and Petri Nets Capacity Bounded Grammars and Petri Nets

2009-07-29

arxiv.org/abs/0907.5136v1

EPTCS 3, 2009, pp. 193-203

Computer Science

Formal Languages and Automata Theory

Scientific paper

10.4204/EPTCS.3.18

A capacity bounded grammar is a grammar whose derivations are restricted by
assigning a bound to the number of every nonterminal symbol in the sentential
forms. In the paper the generative power and closure properties of capacity
bounded grammars and their Petri net controlled counterparts are investigated.

Affiliated with

Also associated with

No associations

Rating

Capacity Bounded Grammars and Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Capacity Bounded Grammars and Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Bounded Grammars and Petri Nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521708