A note on the representation of finite tree automata

DOI10.1016/0020-0190(79)90115-7zbMath0407.68067OpenAlexW2022125103MaRDI QIDQ1258178

Wolfgang Reisig

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90115-7

zbMATH Keywords

Bottom-Up AutomatonGraphical Representation for Finite Tree AutomataTop-Down Automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Behavioural equivalence for infinite systems — Partially decidable!

Cites Work

• Unnamed Item

This page was built for publication: A note on the representation of finite tree automata