Information flow in tabular interpretations for generalized push-down automata

DOI10.1016/S0304-3975(97)00272-7zbMATH Open0983.68103MaRDI QIDQ1129130FDOQ1129130

François Barthélemy, Eric Villemonte de la Clergerie

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Tabular parsing and algebraic transformations
• scientific article; zbMATH DE number 2085263
• Tabulation of automata for tree-adjoining languages
• Bottom-up tree acceptors

zbMATH Keywords

parsinginformation flowlogic programmingtabulationpush-down automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• The equivalence of four extensions of context-free grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Tabular parsing and algebraic transformations
• Title not available (Why is that?)

Uses Software

• XSB

This page was built for publication: Information flow in tabular interpretations for generalized push-down automata

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