Extensions of rooted trees and their applications

DOI10.1016/0012-365X(77)90074-7zbMath0365.05026MaRDI QIDQ1241525

K. Appert

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Finite state languages
• Syntactical definitions of program and flow diagram
• Some notes on finite state languages and events represented by finite automata using labelled graphs
• On the Forms of the Predicates in the Theory of Constructive Ordinals

This page was built for publication: Extensions of rooted trees and their applications