Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:1707.09793v2 (cs)
[Submitted on 31 Jul 2017 (v1), last revised 22 Aug 2017 (this version, v2)]

Title:Generalized Results on Monoids as Memory

Authors:Özlem Salehi (Boğaziçi University, Department of Computer Engineering), Flavio D'Alessandro (Università di Roma "La Sapienza", Dipartimento di Matematica), A. C. Cem Say (Boğaziçi University, Department of Computer Engineering)
View PDF
Abstract:We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that can not be recognized by any rational monoid automaton over a finitely generated permutable monoid. We show that the class of languages recognized by rational monoid automata over finitely generated completely simple or completely 0-simple permutable monoids is a semi-linear full trio. Furthermore, we investigate valence pushdown automata, and prove that they are only as powerful as (finite) valence automata. We observe that certain results proven for monoid automata can be easily lifted to the case of context-free valence grammars.
Comments: In Proceedings AFL 2017, arXiv:1708.06226
Subjects: Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:1707.09793 [cs.FL]
  (or arXiv:1707.09793v2 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.1707.09793
Journal reference: EPTCS 252, 2017, pp. 234-247
Related DOI: https://doi.org/10.4204/EPTCS.252.22

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Mon, 31 Jul 2017 10:25:27 UTC (27 KB)
[v2] Tue, 22 Aug 2017 00:52:49 UTC (22 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2017-07
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Özlem Salehi
Flavio D'Alessandro
A. C. Cem Say
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)