Finite graph-acceptors and regular graph-languages

DOI10.1016/S0019-9958(81)90351-XMaRDI QIDQ3957968zbMATH OpenOpenAlexFDO

Authors Kurt-Ulrich Witt

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(81)90351-x

zbMATH Keywords

data structure for labelled graphsfinitely generated monoid spaces as input tapesgraph-automataregular graph-grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(1)

• Finite automata for efficient graph recognition

This page was built for publication: Finite graph-acceptors and regular graph-languages

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