Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Learning Tree Automata with Term Rewriting

Saved in:
Bibliographic Details
Published in:ArXiv cs.FL Recent Papers
Format: Online Article RSS Article
Published: 2026
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864946161661509635
collection WordPress RSS
FRELIP Feed Integration
container_title ArXiv cs.FL Recent Papers
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:50656
institution FRELIP
journal_source_facet ArXiv cs.FL Recent Papers
publishDate 2026
publishDateSort 2026
record_format rss_article
spellingShingle Learning Tree Automata with Term Rewriting
ArXiv cs.FL Recent Papers
Electrical & Electronics
Engineering & Technology
sub_discipline_display Electrical & Electronics
sub_discipline_facet Electrical & Electronics
subject_display ArXiv cs.FL Recent Papers
Electrical & Electronics
Engineering & Technology
ArXiv cs.FL Recent Papers
Electrical & Electronics
Engineering & Technology
subject_facet ArXiv cs.FL Recent Papers
Electrical & Electronics
Engineering & Technology
title Learning Tree Automata with Term Rewriting
title_auth Learning Tree Automata with Term Rewriting
title_full Learning Tree Automata with Term Rewriting
title_fullStr Learning Tree Automata with Term Rewriting
title_full_unstemmed Learning Tree Automata with Term Rewriting
title_short Learning Tree Automata with Term Rewriting
title_sort learning tree automata with term rewriting
topic ArXiv cs.FL Recent Papers
Electrical & Electronics
Engineering & Technology
url https://arxiv.org/abs/2605.07710v1