Results 1 to 10 of about 318,555 (120)
Formal Choreographic Languages [PDF]
, 2022 We introduce formal choreography languages as a meta-model to study message-passing systems. This allows us to compare and generalise standard constructions and properties from the literature. In particular, we consider notions such as global view, local view, and projections from the former to the latter.
Barbanera, F, Lanese, I, Tuosto, E
openaire +5 more sources
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 +4 more sources
A Theory of Formal Choreographic Languages
Logical Methods in Computer Science, 2023 We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our framework allows us to generalise standard constructions from the literature and to compare them. In particular, we consider notions such as global view, local view, and projections from the former to the latter.
Barbanera, F, Lanese, I, Tuosto, E
openaire +7 more sources
Formalizing Homogeneous Language Embeddings [PDF]
Electronic Notes in Theoretical Computer Science, 2010 The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler. Current homogeneous embedding approaches either restrict the embedding of multiple DSLs in order to provide safety guarantees, or allow multiple DSLs to be embedded but ...
Clark, Tony, Tratt, Laurence
openaire +6 more sources
Formal Languages, Formally and Coinductively [PDF]
Logical Methods in Computer Science, 2017 Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and elegant proofs of classic results in language theory.
openaire +8 more sources
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 lower bound on the length of the shortest word not in uf(L).
Paul C. Bell +2 more
openaire +2 more sources
Unique decipherability in formal languages [PDF]
Theoretical Computer Science, 2020 We consider several language-theoretic aspects of various notions of unique decipherability (or unique factorization) in formal languages. Given a language L at some position within the Chomsky hierarchy, we investigate the language of words UD(L) in L∗ that have unique factorization over L.
Jeffrey Shallit +2 more
openaire +3 more sources
The dynamic complexity of formal languages [PDF]
ACM Transactions on Computational Logic, 2012 The article investigates the power of the dynamic complexity classes D yn FO, D yn QF, and D yn PROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary functions ...
Gelade, Wouter +2 more
openaire +6 more sources
Zeta functions of formal languages [PDF]
Transactions of the American Mathematical Society, 1990 Motivated by symbolic dynamics and algebraic geometry over finite fields, we define cyclic languages and the zeta function of a language. The main result is that the zeta function of a cyclic language which is recognizable by a finite automation is rational.
Berstel, Jean, Reutenauer, Christophe
openaire +3 more sources
Topological entropy of formal languages [PDF]
Semigroup Forum, 2016 We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode congruence relation, we are able to compute the topological entropies of certain example languages.
Friedrich Martin Schneider +1 more
openaire +4 more sources