A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable.

Etsuji Tomita Kazushi Seino

Published in: Theor. Comput. Sci. (1985)

Keyphrases

semidefinite
sufficient conditions
datalog programs
linear complementarity problem
query containment
fixed point
pairwise
first order logic
exponential stability
linear systems
uniform convergence
lyapunov function
asymptotic stability
neural network
optimal policy
logic programs
efficiently computable