Elimination of -rules from matrix grammars with simple repeating structures

MaRDI QIDQ7321454zbMATH OpenFDO

Authors Taishin Yasunobu Nishida

Publication date 28 August 2026

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Full work available at URL https://jalc.de/issues/2025/issue_30_4/jalc-2025-317-358.php

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Bound on Solutions of Linear Integer Equalities and Inequalities
• A structure to decide reachability in Petri nets
• An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• k-Petri Net Controlled Grammars
• Minimal solutions of linear diophantine systems : bounds and algorithms
• On erasing productions in random context grammars
• Petri net controlled grammars with a bounded number of additional places
• Petri net controlled grammars: the case of special Petri nets
• Rational sets in commutative monoids
• TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS

This page was built for publication: Elimination of \(\lambda\)-rules from matrix grammars with simple repeating structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7321454)