On decidability of skeletal sets [Abstract of thesis]
Nguyen Xuang Dung (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Nguyen Xuang Dung (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
F. Němec (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Krystyna Sochacz, J. Szczepkowicz (1966)
Applicationes Mathematicae
Similarity:
Frédéric Hecht (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
Sebastian Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
S. Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
Joanna Jȩdrzejowicz, Andrzej Szepietowski (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We investigate the complexity of languages described by some expressions containing shuffle operator and intersection. We show that deciding whether the shuffle of two words has a nonempty intersection with a regular set (or fulfills some regular pattern) is NL-complete. Furthermore we show that the class of languages of the form , with a shuffle language and a regular language , contains non-semilinear languages and does not form a family of mildly context- sensitive languages. ...