Results 11 to 20 of about 852,128 (332)
Formal Model Engineering for Embedded Systems Using Real-Time Maude [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 This paper motivates why Real-Time Maude should be well suited to provide a formal semantics and formal analysis capabilities to modeling languages for embedded systems.
Peter Csaba Ölveczky
doaj +4 more sources
Breakthrough Contributions of Romance Languages to Formal Linguistics
Isogloss, 2023 Breakthrough Contributions of Romance Languages to Formal Linguistics: Introduction to the Special ...
Cilene Rodrigues +1 more
doaj +1 more source
Formal Language for GeoSpelling [PDF]
Journal of Computing and Information Science in Engineering, 2015 In order to tackle the ambiguities of geometrical product specification (GPS), GeoSpelling language has been developed to express the semantics of specifications. A detailed syntax of GeoSpelling is proposed in this paper. A specification is defined as a sequence of operations on the skin model.
Ballu, Alex +2 more
openaire +3 more sources
Big Picture on Privacy Enhancing Technologies in e-Health: A Holistic Personal Privacy Workflow
Information, 2020 The collection and processing of personal data offers great opportunities for technological advances, but the accumulation of vast amounts of personal data also increases the risk of misuse for malicious intentions, especially in health care.
Stefan Becher +3 more
doaj +1 more source
Functional Automata - Formal Languages for Computer Science Students [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability.
Marco T. Morazán, Rosario Antunez
doaj +1 more source
Factorization in Formal Languages [PDF]
, 2015 We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and
A Lempel +9 more
core +2 more sources
The languages of artificial intelligence, the languages of metaphysics, and the languages of faith
Scientia et Fides, 2014 The formalization of the languages of mathematics has led to the formal languages of computer science and artificial intelligence. This article studies a few semantic properties of the formal languages of artificial intelligence, which I call languages ...
Javier Leach
doaj +1 more source
Finite Automata with Generalized Acceptance Criteria [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree.
Timo Peichl, Heribert Vollmer
doaj +1 more source
Formal language constrained path problems [PDF]
SIAM Journal on Computing, 1998 Summary: Given an alphabet \(\Sigma\), a (directed) graph \(G\) whose edges are weighted and \(\Sigma\)-labeled, and a formal language \(L\subseteq\Sigma^*\), the formal-language-constrained shortest/simple path problem consists of finding a shortest (simple) path \(p\) in \(G\) complying with the additional constraint that \(l(p) \in L\). Here \(l(p)\)
Barrett, C., Jacob, R., Marathe, M.
openaire +2 more sources
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Jorge Almeida, Ondrej Klima
doaj +1 more source