scientific article; zbMATH DE number 3874641

MaRDI QIDQ3340179zbMATH OpenFDO

Authors Giancarlo Mauri, Alberto Bertoni, N. Sabadini

Publication date 1982

zbMATH Keywords

algebraic characterizationpolynomial transformationsleast fixed pointsuniform membership problemcontext-free trace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Membership problems for regular and context-free trace languages
• scientific article; zbMATH DE number 4114058
• scientific article; zbMATH DE number 3870628
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• scientific article; zbMATH DE number 3848633

Cited in

(14)

• scientific article; zbMATH DE number 2150276 (Why is no real title available?)
• The context-freeness problem is coNP-complete for flat counter systems
• scientific article; zbMATH DE number 3273534 (Why is no real title available?)
• scientific article; zbMATH DE number 4058887 (Why is no real title available?)
• scientific article; zbMATH DE number 176237 (Why is no real title available?)
• Theory of traces
• scientific article; zbMATH DE number 4114058 (Why is no real title available?)
• Probabilistic estimation of the number of prefixes of a trace
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• Algebra and Coalgebra in Computer Science
• scientific article; zbMATH DE number 3848633 (Why is no real title available?)
• scientific article; zbMATH DE number 4116001 (Why is no real title available?)
• Preface
• Context free closed families of languages

This page was built for publication:

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