An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
type: Item
instance of: scholarly article
title: An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
zbMATH Open document ID: 1284.68332
author: Taishin Yasunobu Nishida
published in: Theoretical Computer Science
publication date: 2012-08-09T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6064507
zbMATH Keywords: context-free grammar
zbMATH Keywords: context-sensitive grammar
zbMATH Keywords: Petri net
zbMATH Keywords: controlled grammar
zbMATH Keywords: Earley's algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.04.043
OpenAlex ID: W1978829614
cites work: Q4738297
cites work: Q4040325
cites work: k-Petri Net Controlled Grammars
cites work: Q4929333
cites work: Grammars Controlled by Special Petri Nets
cites work: Q3074463
cites work: Q4004136
cites work: An efficient context-free parsing algorithm
cites work: Q3862379
cites work: Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars
cites work: Lectures on Petri nets. 1: Basic models. Advances in Petri nets
cites work: Erasing in Petri Net Languages and Matrix Grammars
DOI: 10.1016/J.TCS.2012.04.043
description: scientific article; zbMATH DE number 6064507