Skip to main navigation Skip to search Skip to main content

Input strictly local tree transducers

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We generalize the class of input strictly local string functions (Chandlee et al. 2014) to tree functions. We show they are characterized by a subclass of frontier-to-root, deterministic, linear tree transducers. We motivate this class from the study of natural language as it provides a way to distinguish local syntactic processes from non-local ones. We give examples illustrating this kind of analysis.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings
EditorsAlberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron
PublisherSpringer
Pages369-381
Number of pages13
ISBN (Print)9783030406073
DOIs
StatePublished - 2020
Event14th International Conference on Language and Automata Theory and Applications, LATA 2020 - Milan, Italy
Duration: Mar 4 2020Mar 6 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12038 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Language and Automata Theory and Applications, LATA 2020
Country/TerritoryItaly
CityMilan
Period03/4/2003/6/20

Keywords

  • Computational syntax
  • Strictly local
  • Tree transducers

Fingerprint

Dive into the research topics of 'Input strictly local tree transducers'. Together they form a unique fingerprint.

Cite this