Researchers have introduced a new model for pattern-based tree transformations, which uses pairs of source and target patterns to define transformations. While the set of expressions matching the source pattern may not be a regular tree language, the proposed model allows for transformations to be represented finitely. A key contribution is the demonstration that the type-checking problem for these transformations is decidable, meaning it's possible to determine if applying a transformation preserves a given regular property of trees. This decision procedure is achieved by reducing the problem to the emptiness problem of alternating tree automata. AI
IMPACT Introduces a new theoretical framework for tree transformations with implications for symbolic manipulation and potentially AI reasoning systems.
RANK_REASON The item is an academic paper published on arXiv detailing a new theoretical model and its decidability properties. [lever_c_demoted from research: ic=1 ai=0.7]
- alphaXiv
- arXiv
- arXivLabs
- Bibliographic Explorer
- CatalyzeX Code Finder for Papers
- computer science
- Connected Papers
- CORE Recommender
- DagsHub
- Formal Languages and Automata Theory
- Gotit.pub
- Hugging Face
- Litmaps
- ScienceCast
- scite Smart Citations
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →