Some remarks on recognizable treeseries
From MaRDI portal
Publication:4240621
DOI10.1080/00207169908804780zbMATH Open0936.68068OpenAlexW2155617474MaRDI QIDQ4240621FDOQ4240621
Authors: Olympia Louscou-Bozapalidou
Publication date: 18 May 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804780
Recommendations
Cites Work
Cited In (12)
- Weighted tree automata and weighted logics
- A note on cut-worthiness of recognizable tree series
- Definable transductions and weighted logics for texts
- PURE AND O-SUBSTITUTION
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- A Medvedev characterization of recognizable tree series
- Title not available (Why is that?)
- Cut sets as recognizable tree languages
- Varieties of recognizable tree series over fields
- The rank of a formal tree power series
- Finitely presentable tree series
- Title not available (Why is that?)
This page was built for publication: Some remarks on recognizable treeseries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240621)