Tree Automata Constructions from Regular Expressions: a Comparative Study

DOI10.3233/FI-2017-1598zbMATH Open1386.68095OpenAlexW2765163883MaRDI QIDQ4606264FDOQ4606264

Djelloul Ziadi, Nadia Ouali Sebti, Ludovic Mignot

Publication date: 2 March 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2017-1598

zbMATH Keywords

partial derivativesautomata theoryderivativesc-continuationsregular tree expressiontree automata constructions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• The Bottom-Up Position Tree Automaton and the Father Automaton
• Construction of Tree Automata from Regular Expressions
• Manipulation of regular expressions using derivatives: an overview

This page was built for publication: Tree Automata Constructions from Regular Expressions: a Comparative Study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606264)