Search results for "Regular"
showing 10 items of 855 documents
Measure-free conditioning and extensions of additive measures on finite MV-algebras
2010
Using the well known representation of any finite MV-algebra as a product of finite MV-chains as factors, we obtain a representation of its canonical extension as a Girard algebra product of the canonical extensions of the MV-chain factors. Based on this representation and using the results from our last paper, we characterize the additive measures on any finite MV-algebra resp. the weakly and the strongly additive measures on its canonical Girard algebra extension, and that as convex combinations of the corresponding measures on the respective factors. After that we apply the results to measure-free defined conditional events which for this reason are considered as elements of the canonica…
A note on the Banach space of preregular maps
2011
The aim of this paper is to give simple proofs for Jeurnink's characterizations of preregular maps in terms of Θ-maps acting between Banach lattices. For Banach lattices E and F, we achieve our goal by considering the space Lβ(E, F) of all those linear maps T: E → F for which there exists a constant K such that {double pipe}Vn i=1 {pipe}Txi{pipe} ≤ K {double pipe}Vn i=1{pipe}xi for all finite sequences x1, ..., xn e{open}E. We show that, if Lβ(E; F), and the spaces L Θ (E; F) of Θ -map and Lpr(E; F) of preregular maps are respectively endowed with their canonical norms, then they are identical Banach spaces
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Unavoidable sets and circular splicing languages
2017
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…
Combinatorial aspects of L-convex polyominoes
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …
Testing Grammars for Parsability
1990
In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
2009
AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DH-PRA by proving that two “forbidden” constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown class is identical to a class known to be not recognizable by 1-way quantum automata. We also prove that the class of languages recognizable by DH-PRA is not closed under union and other non-trivial Boolean operations.
Some properties of vertex-oblique graphs
2016
The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…
On the Soluble Graph of a Finite Simple Group
2013
The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.
Mixed intersections of non quasi-analytic classes
2008
Given two semi-regular matrices M and M' and two open subsets O and O' [resp. two compact subsets K and K'] of Rr and Rs respectively, we introduce the spaces E(M×M')(O × O') and D(M×M')(O × O') [resp. D(M×M')(K × K')]. In this paper we study their locally convex properties and the structure of their elements. This leads in [10] to tensor product representations of these spaces and to some kernel theorems.