On implementation of tree synchronized languages

DOI10.1007/3-540-48685-2_30MaRDI QIDQ4938615zbMATH OpenFDO

Authors Frédéric Saubion, Igor Stéphan

Publication date 6 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48685-2_30

zbMATH Keywords

sequent calculus proof systemtree languages

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1919508
• scientific article; zbMATH DE number 2090087
• scientific article; zbMATH DE number 1705162
• scientific article; zbMATH DE number 1406240
• Synchronized tree automata

Cited in

(4)

• Realization of a binary clocked linear tree and its use for processing texts in natural languages
• scientific article; zbMATH DE number 1919508 (Why is no real title available?)
• scientific article; zbMATH DE number 2090087 (Why is no real title available?)
• scientific article; zbMATH DE number 1406240 (Why is no real title available?)

This page was built for publication: On implementation of tree synchronized languages

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