Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
From MaRDI portal
Publication:2849913
DOI10.1007/978-3-642-40313-2_22zbMath1398.68302arXiv1306.3260OpenAlexW1792270213MaRDI QIDQ2849913
Georg Zetzsche, P. Buckheister
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3260
Related Items
Context-free commutative grammars with integer counters and resets, The emptiness problem for valence automata over graph monoids, Recent advances on reachability problems for valence systems (invited talk), Bounded Context Switching for Valence Systems