Grammar flow analysis reduction to scheduling problem

MaRDI QIDQ1388047zbMATH OpenFDO

Authors K. S. Chebotar'

Publication date 8 June 1998

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

GFA problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Applications of scheduling theory to formal language theory
• Grammar-based integer programming models for multiactivity shift scheduling
• scientific article; zbMATH DE number 4053048
• Parameter-reduction of higher level grammars
• Grammar-based integer programming models for multi-activity shift scheduling
• Minimization of context-free grammars
• REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
• scientific article; zbMATH DE number 1832226
• Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice

Cited in

(1)

• scientific article; zbMATH DE number 177787 (Why is no real title available?)

This page was built for publication: Grammar flow analysis reduction to scheduling problem

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