An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
From MaRDI portal
Publication:5175903
DOI10.1007/978-3-319-08019-2_31zbMath1432.68233arXiv1401.5951OpenAlexW1879289258MaRDI QIDQ5175903
Nadia Ouali Sebti, Djelloul Ziadi, Ludovic Mignot
Publication date: 25 February 2015
Published in: Language, Life, Limits (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5951
Related Items (2)
An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ From Tree Automata to Rational Tree Expressions
This page was built for publication: An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations