scientific article; zbMATH DE number 1101595

MaRDI QIDQ4371017zbMATH OpenFDO

Authors Javier Esparza, Peter Rossmanith

Publication date 20 September 1998

zbMATH Keywords

context-free languagesmonadic string-rewritten systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• An efficient automata approach to some problems on context-free grammars.
• scientific article; zbMATH DE number 3932414
• scientific article; zbMATH DE number 3259059
• A uniform framework for problems on context-free grammars
• scientific article; zbMATH DE number 3858444
• An Automata Characterisation for Multiple Context-Free Languages
• scientific article; zbMATH DE number 1556865
• scientific article; zbMATH DE number 1962766
• Random context structure grammars and automata - a formal approach
• scientific article; zbMATH DE number 139799

Cited in

(7)

• The complexity of bisimilarity-checking for one-counter processes.
• Simulating finite automata with context-free grammars.
• Random context structure grammars and automata - a formal approach
• A complete refinement procedure for regular separability of context-free languages
• A uniform framework for problems on context-free grammars
• Pre*: The Predecessors of a Regular Language w.r.t. a Context-Free Grammar, with Applications
• An efficient automata approach to some problems on context-free grammars.

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 Q4371017)