On ground word problem of term equation systems
Logic in Computer Science
2012-09-10 v2
Authors:
Sandor Vagvolgyi
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.
Cite
@article{arxiv.0902.4348,
title = {On ground word problem of term equation systems},
author = {Sandor Vagvolgyi},
journal= {arXiv preprint arXiv:0902.4348},
year = {2012}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Deciding Word Problems of Semigroups using Finite State Automata
Max Neunhöffer, Markus Pfeiffer, Nik Ruskuc
2019-10-17
Classical Analysis and ODEs · Mathematics
Persistence and periodic solutions in systems of delay differential equations
Pablo Amster, Melanie Bondorevsky
2020-02-04
Commutative Algebra · Mathematics
Analysis of linear systems over idempotent semifields
Fateme Olia, Shaban Ghalandarzadeh, Amirhossein Amiraslani, Sedighe Jamshidvand
2019-06-25
Symbolic Computation · Computer Science
On Probabilistic Term Rewriting
Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
2018-02-28
Formal Languages and Automata Theory · Computer Science
Systems of Word Equations and Polynomials: a New Approach
Aleksi Saarela
2011-08-19
Differential Geometry · Mathematics
Prolongations of Geometric Overdetermined Systems
Thomas Branson, Andreas Cap, Michael Eastwood, Rod Gover
2008-11-26
Computation and Language · Computer Science
Semi-supervised Learning for Word Sense Disambiguation
Darío Garigliotti
2019-08-27
Symbolic Computation · Computer Science
Size reduction and partial decoupling of systems of equations
Thomas Wolf
2007-05-23
Formal Languages and Automata Theory · Computer Science
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms
Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano
2013-11-25
Combinatorics · Mathematics
Systems of word equations, polynomials and linear algebra: A new approach
Aleksi Saarela
2015-02-10
Group Theory · Mathematics
Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup
Nabilah Abughazalah
2016-12-08
Group Theory · Mathematics
Genetic Algorithms for Word Problems in Partially Commutative Groups
Matthew Craven
2007-05-23
Computation and Language · Computer Science
Mapping to Declarative Knowledge for Word Problem Solving
Subhro Roy, Dan Roth
2017-12-29
Logic in Computer Science · Computer Science
Reducing the Complexity of Quantified Formulas via Variable Elimination
Aboubakr Achraf El Ghazi, Mattias Ulbrich, Mana Taghdiri, Mihai Herda
2014-08-05
Atmospheric and Oceanic Physics · Physics
Stability of Semi-Implicit and Iterative Centred-Implicit Time Discretizations for Various Equation Systems Used in NWP
Pierre Benard
2009-11-10
Formal Languages and Automata Theory · Computer Science
A Complete Refinement Procedure for Regular Separability of Context-Free Languages
Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard +1
2014-11-20
Optimization and Control · Mathematics
Gramian Tensor Decomposition via Semidefinite Programming
Erik Skau, Agnes Szanto
2017-08-10
Formal Languages and Automata Theory · Computer Science
On the Use of Quasiorders in Formal Language Theory
Pedro Valero
2020-08-21
Strongly Correlated Electrons · Physics
Solving condensed-matter ground-state problems by semidefinite relaxations
Thomas Barthel, Robert Hübener
2012-08-08
Logic in Computer Science · Computer Science
On Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time
Simon Guilloud, Viktor Kunčak
2022-03-08
Optimization and Control · Mathematics
Approximation Algorithms for Optimization of Combinatorial Dynamical Systems
Insoon Yang, Samuel A. Burden, Ram Rajagopal, S. Shankar Sastry +1
2016-10-31
Artificial Intelligence · Computer Science
Semiring Programming: A Declarative Framework for Generalized Sum Product Problems
Vaishak Belle, Luc De Raedt
2020-01-14
Machine Learning · Computer Science
Simple Alternating Minimization Provably Solves Complete Dictionary Learning
Geyu Liang, Gavin Zhang, Salar Fattahi, Richard Y. Zhang
2025-03-06
Computation and Language · Computer Science
Solvability of orbit-finite systems of linear equations
Arka Ghosh, Piotr Hofman, Sławomir Lasota
2024-02-28
Computation and Language · Computer Science
Clinical Text Prediction with Numerically Grounded Conditional Language Models
Georgios P. Spithourakis, Steffen E. Petersen, Sebastian Riedel
2016-10-21