On ground word problem of term equation systems

Sándor Vágvölgyi

doi:10.14232/actacyb.22.2.2015.16

Skip to main content Skip to main navigation menu Skip to site footer

On ground word problem of term equation systems

Sándor Vágvölgyi

DOI: https://doi.org/10.14232/actacyb.22.2.2015.16

Abstract

We give semi-decision procedures for the ground word problem of variable preserving term equation systems and term equation systems. They are natural improvements of two well known trivial semi-decision procedures. We show the correctness of our procedures.

Downloads

Download data is not yet available.

PDF

Published

2015-01-01

How to Cite

Vágvölgyi, S. (2015). On ground word problem of term equation systems. Acta Cybernetica, 22(2), 517-551. https://doi.org/10.14232/actacyb.22.2.2015.16

Download Citation

Issue

Vol 22 No 2 (2015)

Section

Regular articles

Most read articles by the same author(s)

Sándor Vágvölgyi, On compositions of root-to-frontier tree transformations , Acta Cybernetica: Vol 7 No 4 (1986)
Zoltán Fülöp, Sándor Vágvölgyi, Results on compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 1 (1987)
Sándor Vágvölgyi, Zoltán Fülöp, An infinite hierarchy of tree transformations in the class NDR , Acta Cybernetica: Vol 8 No 2 (1987)
Zoltán Fülöp, Sándor Vágvölgyi, On ranges of compositions of deterministic root-to-frontier tree transformations , Acta Cybernetica: Vol 8 No 3 (1988)
Sándor Vágvölgyi, [Könyvismertetés] , Acta Cybernetica: Vol 8 No 3 (1988)
Sándor Vágvölgyi, One-Pass Reductions , Acta Cybernetica: Vol 22 No 3 (2016)
Zoltán Fülöp, Sándor Vágvölgyi, Minimization of deterministic top-down tree automata , Acta Cybernetica: Vol 23 No 1 (2017)