共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Ernst Leiss 《Theoretical computer science》1981,13(3):323-330
Boolean automata are a generalization of finite automata in the sense that the ‘next state’, i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. Boolean automata accept precisely regular languages; furthermore they correspond in a natural way to certain language equations as well as to sequential networks. We investigate the succinctness of representing regular languages by boolean automata. In particular, we show that for every deterministic automaton A with m states there exists a boolean automaton with [log2m] states which accepts the reverse of the language accepted by A (m≥1). We also show that for every n≥1 there exists a boolean automation with n states such that the smallest deterministic automaton accepting the same language has 2(2n) states; moreover this holds for an alphabet with only two letters. 相似文献
3.
This paper shows how trees can be stored in a very compact form, called ‘Bonsai’, using hash tables. A method is described that is suitable for large trees that grow monotonically within a predefined maximum size limit. Using it, pointers in any tree can be represented within 6 + [log2n] bits per node where n is the maximum number of children a node can have. We first describe a general way of storing trees in hash tables, and then introduce the idea of compact hashing which underlies the Bonsai structure. These two techniques are combined to give a compact representation of trees, and a practical methodology is set out to permit the design of these structures. The new representation is compared with two conventional tree implementations in terms of the storage required per node. Examples of programs that must store large trees within a strict maximum size include those that operate on trie structures derived from natural language text. We describe how the Bonsai technique has been applied to the trees that arise in text compression and adaptive prediction, and include a discussion of the design parameters that work well in practice. 相似文献
4.
We analyze the effect of the degree of isolation of a cut point on the number of states P(U, ) of a probabilistic automaton representing the language U. We give an example of a language Un consisting of words of length n such that there exist numbers < for which P(Un, )/P(Un, )0 as n.Translated from Kibernetika, No. 3, pp. 21–25, May–June, 1989. 相似文献
5.
We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages. 相似文献
6.
We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]). 相似文献
7.
Joost Engelfriet 《Theoretical computer science》1976,2(1):9-27
The surface tree languages obtained by top-down finite state transformation of monadic trees are exactly the frontier-preserving homomorphic images of sets of derivation trees of ETOL systems. The corresponding class of tree transformation languages is therefore equal to the class of ETOL languages. 相似文献
8.
9.
Efficient memory representation of XML document trees 总被引:1,自引:0,他引:1
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. In this paper, a technique is presented that allows to represent the tree structure of an XML document in an efficient way. The representation exploits the high regularity in XML documents by compressing their tree structure; the latter means to detect and remove repetitions of tree patterns. Formally, context-free tree grammars that generate only a single tree are used for tree compression. The functionality of basic tree operations, like traversal along edges, is preserved under this compressed representation. This allows to directly execute queries (and in particular, bulk operations) without prior decompression. The complexity of certain computational problems like validation against XML types or testing equality is investigated for compressed input trees. 相似文献
10.
11.
12.
In the last years, attention has been devoted to the development of ontologies, which are ICT conceptual models allowing a formal and shared representation of a particular domain of discourse, and to the use of these representations in a variety of contexts, among which also the industrial engineering can be counted. Within the industrial engineering field, the manufacturing domain has not yet seen a wide application of ontologies. This paper firstly shows the use of ontologies for the semantic annotation of a Web Service-based architecture for the control of manufacturing systems; and then contributes to the research field of manufacturing domain ontologies by proposing a thorough literature review and analysis of the available languages supporting such objective. The paper collects the main requirements that semantic languages must meet to be used in the manufacturing domain with the outlined purpose. In fact, the available semantic languages are several and characterized by different features: the paper identifies the most proper ones for the manufacturing domain representation thanks to their analysis against the main requirements. Lastly, the paper shows how the discussed topics are deployed in a real industrial example. 相似文献
13.
《Information Processing Letters》2001,77(5-6):231-238
14.
15.
Gyula A. Magó 《International journal of parallel programming》1979,8(5):349-385
This paper describes the architecture of a cellular processor capable of directly and efficiently executing reduction languages as defined by Backus. The processor consists of two interconnected networks of microprocessors, one of which is a linear array of identical cells, and the other a tree-structured network of identical cells. Both kinds of cells have modest processing and storage requirements. The processor directly interprets a high-level language, and its efficient operation is not restricted to any special class of problems. Memory space permitting, the processor accommodates the unbounded parallelism allowed by reduction languages in any single user program; it is also able to execute many user programs simultaneously. 相似文献
16.
17.
A fast ray tracing algorithm of CSG tree is presented. The algorithm uses an adaptive space subdivisions approach, based on the conversion of the objects of the scene into the volumetric Sticks representation scheme. This conversion scheme, which requires O(kn2) memory space to represent data in a n3 grid, makes it possible either to obtain very fast low-quality frontal orthographic projections, or to produce a high-quality rendering of the scene in time less than that needed by classical ray tracing and nearly independent of the number of objects in the scene. Furthermore, the characteristics of the Sticks scheme can be exploited to compute geometric or topological properties of the represented objects. Comparative analyses between the Sticks representation scheme and classical space subdivision schemes and between our Sticksbased ray tracing and classical algorithms are presented. 相似文献
18.
19.
Yunmei Dong 《中国科学F辑(英文版)》2002,45(1):25-39
It is intended to establish the recursive function theory on context free languages (CFLs). In this paper, the function class
CFRF and its proper subclass CFPRF were defined on CFLs; it is quite straightforward to use them for describing non-numerical
algorithms. In fact, they are respectively the partial recursive functions and primitive recursive functions of context free
languages. The structure induction method for proving CFPRF function properties was presented. A method for CFL sentence enumeration
was given, the minimization operator was defined. Based on CFL sentence enumeration, the minimization operator evaluation
method was given. Finally, the design and implementation principles of executable specification languages with the CFRF as
theoretical basis were discussed.
This paper is based on the Technical Report ISCAS-LCS-2k-03 (SAQ Report No. 30): Recursive Functions Defined on Context Free
Languages (I), August 2000, with minor revisions. 相似文献