k-Petri Net Controlled Grammars

DOI10.1007/978-3-540-88282-4_20zbMath1156.68424OpenAlexW1601504131MaRDI QIDQ3540110

Sherzod Turaev, Juergen Dassow

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars ⋮ An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules ⋮ Erasing in Petri Net Languages and Matrix Grammars

Cites Work

• Unnamed Item
• Lectures on Petri nets. 1: Basic models. Advances in Petri nets
• Petri net algorithms in the theory of matrix grammars
• Petri nets and szilard languages

This page was built for publication: k-Petri Net Controlled Grammars