TTSLI: An implementation of tree-tuple synchronized languages

DOI10.1007/3-540-45610-4_28MaRDI QIDQ4808762zbMATH OpenFDO

Authors Benoit Lecland, Pierre Réty

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2378/23780376.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Synchronized tree languages revisited and new applications
• On implementation of tree synchronized languages
• Synchronized tree automata
• Synchronization trees
• scientific article; zbMATH DE number 1919508

Cited in

(4)

• TTSLI
• Synchronized tree languages revisited and new applications
• On implementation of tree synchronized languages
• Tree tuple languages from the logic programming point of view

This page was built for publication: TTSLI: An implementation of tree-tuple synchronized languages

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