scientific article; zbMATH DE number 475416

MaRDI QIDQ4273663zbMATH OpenFDO

Authors Bruno Courcelle

Publication date 13 January 1994

zbMATH Keywords

finite-state automatarecognizable setsunrooted, undirected trees

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• Logics and Automata for Totally Ordered Trees
• Different local controls for graph relabeling systems
• Feature automata and recognizable sets of feature trees
• Basic notions of universal algebra for language theory and graph grammars

This page was built for publication:

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