"Recognizability of languages via deterministic finite automata with values ..."

José Ramón González de Mendívil, Federico Fariña (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-02-18

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2102-05968
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-05968
José Ramón González de Mendívil, Federico Fariña:
Recognizability of languages via deterministic finite automata with values on a monoid: General Myhill-Nerode Theorem. CoRR abs/2102.05968 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.