Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding finite automata that certify termination of string rewriting systems."

Alfons Geser et al. (2005)

> Home

Details and statistics

DOI: 10.1142/S0129054105003108

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/GeserHWZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/GeserHWZ05
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16(3): 471-486 (2005)

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.