Disjunctive languages and compatible orders
M. Ito, H. J. Shyr, G. Thierrin (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On some factorization problems.”
Disjunctive languages and compatible orders
Decidability of code properties
Henning Fernau, Klaus Reinhardt, Ludwig Staiger (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
We explore the borderline between decidability and undecidability of the following question: “Let be a class of codes. Given a machine of type , is it decidable whether the language lies in or not?” for codes in general, -codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.
Rebootable and suffix-closed -power languages
B. Le Saëc, I. Litovsky (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Mixed formulation of elliptic variational inequalities and its approximation
Jaroslav Haslinger (1981)
Aplikace matematiky
Similarity:
The approximation of a mixed formulation of elliptic variational inequalities is studied. Mixed formulation is defined as the problem of finding a saddle-point of a properly chosen Lagrangian on a certain convex set . Sufficient conditions, guaranteeing the convergence of approximate solutions are studied. Abstract results are applied to concrete examples.