- Full text PDF available (8)
- This year (1)
- Last 5 years (12)
- Last 10 years (19)
Journals and Conferences
Plastic biliary stents are commonly used during Endoscopic Retrograde Cholangio-Pancreatography (ERCP). The main indication for biliary stenting is benign or malignant obstruction. Plastic stents, among others, can be used as an escape route in patients with large common bile duct stones, or in cases of acute cholangitis with or without sphincterotomy to… (More)
Graph language recognizability is defined and investigated by virtue of the syntactic magmoid, analogously with the syntactic monoid of a word language. In this setup, the syntax complexity of a given recognizable graph language can be determined, giving rise to a syntactic classification inside the class of recognizable graph languages.
The magmoid of hypergraphs labelled over a finite doubly ranked alphabet, is characterized as the quotient of the free magmoid generated by this alphabet divided by a finite set of equations. Thus a relevant open problem, posed by Engelfriet and Vereijken, is being solved.
Directed fuzzy hypergraphs are introduced as a generalization of both crisp directed hypergraphs and directed fuzzy graphs. It is proved that the set of all directed fuzzy hypergraphs can be structured into a magmoid with operations graph composition and disjoint union. In this framework a notion of syntactic recognition inside magmoids is defined. The… (More)
Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
A k-bounded recognizable pattern language is the set of all k-bounded patterns that are obtained as behaviors of a pattern automaton. The emptiness and the equality problems for k-bounded behaviors of pattern automata are proved to be decidable. Moreover, we examine their relationship with context free pattern grammars, which are basically the hyperedge… (More)