The Emptiness Problem for Valence Automata over Graph Monoids

Zetzsche, Georg

doi:10.1016/j.ic.2020.104583

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The Emptiness Problem for Valence Automata over Graph Monoids

MPS-Authors

/persons/resource/persons230970

Zetzsche, Georg
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

1-s2.0-S0890540120300717-main.pdf
(Publisher version), 488KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Zetzsche, G. (2021). The Emptiness Problem for Valence Automata over Graph Monoids. Information and Computation, 104583, pp. 1-18. doi:10.1016/j.ic.2020.104583.

Cite as: https://hdl.handle.net/21.11116/0000-0009-5551-C

Abstract

There is no abstract available