"Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems."

Andreas Gebhardt, Johannes Waldmann (2009)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-16

- view
  - electronic edition @ u-szeged.hu
- export record
  dblp key:
  - journals/actaC/GebhardtW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/actaC/GebhardtW09
Andreas Gebhardt, Johannes Waldmann:
Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. Acta Cybern. 19(2): 295-312 (2009)

a service of

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.