Filters








71,950 Hits in 5.0 sec

Closure Properties of Pattern Languages [chapter]

Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2014 Lecture Notes in Computer Science  
In the present paper we establish a large number of closure properties of the terminal-free pattern languages, and we characterise when the union of two terminal-free pattern languages is again a terminal-free  ...  Pattern languages are a well-established class of languages that is particularly popular in algorithmic learning theory, but very little is known about their closure properties.  ...  The authors wish to thank the anonymous referees for their helpful suggestions, which have yielded a stronger version of Proposition 7.  ... 
doi:10.1007/978-3-319-09698-8_25 fatcat:w2qdmirckvadrllzg7kznkhr44

Closure properties of pattern languages

Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2017 Journal of computer and system sciences (Print)  
Pattern languages are a well-established class of languages, but very little is known about their closure properties.  ...  In the present paper we establish a large number of closure properties of the terminal-free pattern languages, and we characterise when the union of two terminal-free pattern languages is again a terminal-free  ...  Furthermore, Kai Salomaa's suggestion to extend this paper to pattern languages over unary alphabets is gratefully acknowledged, and reflected by several results in this paper.  ... 
doi:10.1016/j.jcss.2016.07.003 fatcat:q5n5xsywjzevbc3wvqickx6s5m

Tree pattern matching from regular tree expressions

Ahlem Belabbaci, Hadda Cherroun, Loek Cleophas, Djelloul Ziadi
2018 Kybernetika (Praha)  
From the definition of ε−closure(t) we can deduce the following properties: Property 3.2. Let t 1 , t 2 ∈ T Σ . We have then ε−closure(t 1 · c t 2 ) = ε−closure(t 1 ) · c ε−closure(t 2 ).  ...  Using Property 3.2, we get ε−closure(t) = g(ε−closure(t 1 ), ε−closure(t 2 ), · · · , ε−closure(t n )).  ... 
doi:10.14736/kyb-2018-2-0221 fatcat:ec3rvph23nhqtgnv2q7ugelezm

Page 6512 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
We focus on properties represented by regular languages, w-regular languages, or propositional LTL formulae and show that for such properties there is a wide class of equivalence relations for which determining  ...  Among the closure properties we are able to handle, one finds trace closedness, stutter closedness and projective closedness, for all of which we are also able to prove a PSPACE lower bound.  ... 

Closure Properties of Prefix-free Regular Languages

Meenu Lochan, Sunita Garhwal, Ajay Kumar
2012 International Journal of Computer Applications  
In this paper various closure properties of prefix-free regular languages are investigated and result shows that prefix-free regular languages are closed under union and concatenation.  ...  Under complementation, reverse, Kleene-closure and intersection operations prefix-free regular languages are not closed.  ...  In future work can be carried out on closure properties of suffix-free and infix-free regular languages.  ... 
doi:10.5120/8220-1645 fatcat:qgziv2h4arajvbtmqes63iea2i

Dynamically linked domain-specific extensions for advice languages

Tom Dinkelaker, Mira Mezini
2008 Proceedings of the 2008 AOSD workshop on Domain-specific aspect languages - DSAL '08  
Domain-specific aspect languages allow defining aspects for a certain problem domain faster and easier by providing specialized expressivity and by reducing the complexity of the language interface.  ...  With current approaches only specialists can build new domain specific aspect languages; in doing so they have to replicate large parts of the tool set.  ...  This pattern applies to any host language that provides the following features: (1) object-oriented constructs that allow a modularized implementation of the domain logic, (2) code blocks or closures as  ... 
doi:10.1145/1404927.1404930 fatcat:qrtemtrsnbbz7m6r7otggbzcia

Logic-Based Model-Level Software Development with F-OML [chapter]

Mira Balaban, Michael Kifer
2011 Lecture Notes in Computer Science  
F-OML supports a wide variety of model-level activities, such as extending UML diagrams, defining design patterns, reasoning about UML diagrams, testing UML diagrams, specification of Domain Specific Modeling  ...  F-OML is a semantic layer on top of an elegant logic programming language of guarded path expressions, called PathLP.  ...  The property constructor closure is used to define the new parameterized properties closure(parent) and closure(child) that provide the necessary mappings.  ... 
doi:10.1007/978-3-642-24485-8_38 fatcat:ldywbcboqfapbjtzena2a4pjoy

Taking the RDF Model Theory Out for a Spin [chapter]

Ora Lassila
2002 Lecture Notes in Computer Science  
In this paper we give some results in our investigation of a practical implementation of the entailment rules, based on the graph-walking query mechanism of the Wilbur RDF toolkit.  ...  to have to realize the vision of the "Semantic Web".  ...  , Louis Theran and the anonymous reviewers of the ISWC program committee.  ... 
doi:10.1007/3-540-48005-6_24 fatcat:datwhsgqlvfivhpn47oklexbey

Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution [chapter]

Heather Miller, Philipp Haller, Martin Odersky
2014 Lecture Notes in Computer Science  
FP and OO languages.  ...  , thread-safe, or even have custom user-defined properties.  ...  Acknowledgements We would like to thank the anonymous ECOOP 2014 referees for their thorough reviews and helpful suggestions which greatly improved the quality of the paper.  ... 
doi:10.1007/978-3-662-44202-9_13 fatcat:idnybttr55egvpf2sarwh6dkmy

On the Semantics of Matching Trace Monitoring Patterns [chapter]

Pavel Avgustinov, Julian Tibble, Oege de Moor
2007 Lecture Notes in Computer Science  
INTRODUCTION Many runtime verification properties can be expressed as a pattern that is matched against the trace of runtime events.  ...  languages (context-free grammars, or their closure under intersection -this is the class of languages accepted by [3] ).  ... 
doi:10.1007/978-3-540-77395-5_2 fatcat:sc2beo5ovzgjrprle3fomhm32a

Two-Dimensional Pattern Languages [article]

Henning Fernau, Markus L. Schmid, K. G. Subramanian
2017 arXiv   pre-print
These classes of two-dimensional pattern languages are compared with respect to their expressive power and their closure properties are investigated.  ...  We introduce several classes of array languages obtained by generalising Angluin's pattern languages to the two-dimensional case.  ...  Closure Properties of Array Pattern Languages The research of closure properties of classes of formal languages is a classical topic in this area.  ... 
arXiv:1707.04083v1 fatcat:ecs6yxe72ra6dekj7i3y42pjxa

Experiments with a High-Level Navigation Language [chapter]

Jesús Sánchez Cuadrado, Frédéric Jouault, Jesús García Molina, Jean Bézivin
2009 Lecture Notes in Computer Science  
Model transformation languages often implement some variants of OCL as their navigation language.  ...  An approach to tackle this issue is to raise the level of abstraction of the navigation language.  ...  For instance, pattern languages use object properties to constraint query results. Such properties can be helpers dened by an HLN library, since the VM makes the integration seamless.  ... 
doi:10.1007/978-3-642-02408-5_16 fatcat:lbuf2a2dyfcivkgr7qgh3fkwuq

Typological Adaptation of Japanese Stops in Korean

Juhee Lee
2011 Linguistic Research  
More specifically, we argue that the phonemic vs. phonetic mapping patterns can be decided based on the laryngeal typology of the target and the recipient languages.  ...  Typological Adaptation of Japanese Stops in Korean. Linguistic Research 28(1), 75-93. This paper examines the loanword adaptation patterns for Japanese stops into Korean.  ...  For example, Shinohara (1997) shows that the adaptation pattern of French loanwords in Japanese follows the voicing correspondence between these two [voice] languages.  ... 
doi:10.17250/khisli.28.1.201104.005 fatcat:cgabjyjqtrecph6i66ipjeiasy

A Characterization for Decidable Separability by Piecewise Testable Languages [article]

Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
2017 arXiv   pre-print
In this work, we assume some mild closure properties for C and study for which such classes separability by a piecewise testable language (PTL) is decidable.  ...  Our characterization involves a result of independent interest, which states that for any kind of languages I and E, non-separability by PTL is equivalent to the existence of common patterns in I and E  ...  Acknowledgments We would like to thank Tomáš Masopust for pointing us to (Hunt III, 1982) and Thomas Place for pointing out to us that determining if a given context-free language is piecewise testable  ... 
arXiv:1410.1042v3 fatcat:hzgrzuioq5fjjkqxvpsoet4al4

Generative Power and Closure Properties of Watson-Crick Grammars

Nurul Liyana Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, Azeddine Messikh
2016 Applied Computational Intelligence and Soft Computing  
We defineWK linear grammars, as an extension of WK regular grammars with linear grammar rules, andWK context-free grammars, thus investigating their computational power and closure properties.  ...  Moreover, we demonstrate that the family of WK regular languages is the proper subset of the family of WK linear languages, but it is not comparable with the family of linear languages.  ...  Acknowledgments This work has been supported through International Islamic University Endowment B research Grant EDW B14-136-1021 and Fundamental Research Grant Scheme FRGS13-066-0307, Ministry of Education  ... 
doi:10.1155/2016/9481971 fatcat:sd5wg54bgzed7geim5wijv34au
« Previous Showing results 1 — 15 out of 71,950 results