Semigroups acting on context-free graphs

DOI10.1007/3-540-61440-0_129MaRDI QIDQ4818836zbMATH OpenFDO

Authors Géraud Sénizergues

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_129

zbMATH Keywords

endsinfinite graphspushdown automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3898926
• Semigroup as graphs
• scientific article; zbMATH DE number 3396224
• On Cayley graphs of semilattices of semigroups.
• Syntactic semigroups and graph algebras
• Intersection graphs associated with semigroup acts
• On Cayley graphs of some semigroups
• Graph products of semigroups
• Structural aspects of semigroups based on digraphs
• Semigroups characterizing hypergraphs

Cited in

(3)

• Context-free pairs of groups. I: Context-free pairs and graphs
• Syntactic semigroups and graph algebras
• Logical aspects of Cayley-graphs: the group case

This page was built for publication: Semigroups acting on context-free graphs

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