15,608 Hits in 6.2 sec

On the Parallel Complexity of Tree Automata [chapter]

Markus Lohrey
2001 Lecture Notes in Computer Science  
× ÓÚ Ö Ò ¸ Ø × ¬Ò × Ù×٠к Ì ÛÓÖ ØÖ × Ù× × ×ÝÒÓÒÝÑ ÓÖ Ø ÖѺ Ï Ù× Ø Ö Ú Ø ÓÒ Ì´ µ Ì´ µ¸Ø × × Ø × ÐÐ Ø × Ø Ó ÖÓÙÒ Ø ÖÑ× ÓÚ Ö º Ï ÒØ Ý Ø × Ø Ì´ µ Û Ø Ø ÓÖÖ ×ÔÓÒ Ò Ö Ø ÖÑ Ð Ö ÓÚ Ö Ø × Ò ØÙÖ º ÁÒ ÓÑÔÙØ Ø ÓÒ  ...  Ð ÔÖÓ Ð Ñ× Ø ÖÑ× Û ÐÐ ÐÛ Ý× Ö ÔÖ × ÒØ Ý Ø Ö ÔÖ ¬Ü¹ÓÔ Ö ØÓÖ ÒÓØ Ø ÓÒ¸Û × ÛÓÖ ÓÚ Ö Ø ÐÔ Ø º Ì × Ø Ó ÐÐ Ø × ÛÓÖ × × ÒÓÛÒ × Ø ÄÙ × Û Þ¹Ð Ò Ù Ä´ µ ÓÖ Ø Ö Ò ÐÔ Ø º ÓÖ Ò×Ø Ò ¾ Ä´ µ ÙØ ¾ Ä´ µº Ï Ò Û ÛÖ Ø Ø ÖÑ  ... 
doi:10.1007/3-540-45127-7_16 fatcat:2vsnbmvlnvaedasp2jwuj2zem4

Automata for XML—A survey

Thomas Schwentick
2007 Journal of computer and system sciences (Print)  
This survey article aims to give an overview of fundamental properties of the different kinds of automata used in this area and to relate them to the four key aspects of XML processing: schemas, navigation  ...  Automata play an important role for the theoretical foundations of XML data management, but also in tools for various XML processing tasks.  ...  Acknowledgments The author warmly thanks Joost Engelfriet, Christoph Koch, Sebastian Maneth, Wim Martens, Maarten Marx, Frank Neven, and Volker Weber and two anonymous for very many valuable suggestions  ... 
doi:10.1016/j.jcss.2006.10.003 fatcat:rhcckietinczlgoglqehlg2gza

Page 3961 of Mathematical Reviews Vol. , Issue 91G [page]

1991 Mathematical Reviews  
The author studies the complexity of the equivalence problem for finite tree automata.  ...  For this purpose the author introduces finite tree automata with weights in a semiring and is able to establish a generaliza- tion of Eilenberg’s equality theorem to finite tree automata.  ... 

Page 1218 of Mathematical Reviews Vol. , Issue 83c [page]

1983 Mathematical Reviews  
From the introduction: “Our aim is to generalize the results of the classical theory of automata to ascending tree automata.  ...  Employing the models of sequential-parallel computations, the author considers the problem of the parallel ordering of data arrays.  ... 

An Unbounded Parallel Binary Tree Adder for use on a Cellular Platform

James Weston, Peter Lee
2007 2007 IEEE Symposium on Artificial Life  
The highly parallel nature of the cellular automata framework permits the creation of a multitude of structures, endowed with the flexibility to perform vast amounts of calculations concurrently.  ...  This flexibility and parallelism is also now present in a number of hardware platforms allowing for the adaptation of automata models into hardware.  ...  One of the advantages of such a parallel system is the homogeneity of the implementation.  ... 
doi:10.1109/alife.2007.367821 dblp:conf/ieeealife/Weston007 fatcat:qzm7ck33xbblzaag6nwjm6aopu

State complexity of the concatenation of regular tree languages

Xiaoxue Piao, Kai Salomaa
2012 Theoretical Computer Science  
We consider the state complexity of basic concatenation operations for regular tree languages.  ...  We show that the sequential (respectively, parallel) concatenation of tree languages recognized by deterministic bottom-up automata with m and n states can be recognized by an automaton with (n+1)·(m·2  ...  When considering the state complexity of tree automata operating on unranked trees, it is convenient to allow the use of incomplete automata, and in order to keep 2 As usual, we view trees to be drawn  ... 
doi:10.1016/j.tcs.2011.12.048 fatcat:sn4srx24xvdnrbkhxih6i4sdfy

Page 4199 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
Weil [Pascal Weil], Series-parallel posets: algebra, automata and lan- guages (555-565); Rainer Kemp, On the expected number of nodes at level & in 0-balanced trees (566-576); Martin Charles Golumbic and  ...  Burgisser, On the structure of Valiant’s complexity classes (194-204); Detlef Sieling, On the existence of polynomial time approximation schemes for OBDD minimization (extended abstract) (205-215); J.  ... 

Page 4257 of Mathematical Reviews Vol. , Issue 84j [page]

1984 Mathematical Reviews  
The minimum space-cost of an N-key NVO HB 2-3 brother tree and the space-cost of an N-key SCO HB 2-3 brother tree is analysed.” 84):68041 84}:68042 Ivanov, E. A. Parallel algorithms on graphs.  ...  (D-HANN) On cofinal and definite automata. Acta Cybernet. 6 (1983), no. 2, 181-189. The authors investigate some well-known types of finite automata from the point of view of their structure.  ... 

Page 3872 of Mathematical Reviews Vol. , Issue 83i [page]

1983 Mathematical Reviews  
A complexity notion for automata is defined so that precisely the reduced automata are of finite complexity.  ...  Author’s summary: “The complexity of solving the knapsack problem with n input real numbers on a parallel computer with real arithmetic and branching operations is considered.  ... 

Page 6219 of Mathematical Reviews Vol. , Issue 95j [page]

1995 Mathematical Reviews  
on ned into *hine scted ns of an be times parch being also 6219 68Q Theory of computing closely linked with the main open problems in complexity theory.  ...  Our positive result opens a theory of varieties of w-tree languages, in extension of the ones for finite and infinite words and finite trees.”  ... 

Page 271 of Automation and Remote Control Vol. 55, Issue 2 [page]

1994 Automation and Remote Control  
The majority of the results obtained in the field of the complexity of sequential modeling of parallel archi- tectures concern only systolic architectures (arrays, trees, etc.).  ...  Automation and Remote Control, Vol. 55 , No. 2, 1994 AUTOMATA COMPLEXITY OF SEQUENTIAL REALIZATION OF CELLULAR AUTOMATA MAPS A. I.  ... 

Page 986 of Mathematical Reviews Vol. , Issue 87b [page]

1987 Mathematical Reviews  
Iterative tree automata (ITA) are infinite tree-connected networks of finite state automata with serial input and output at the root of the tree and a bidirectional flow of data.  ...  The authors consider ITA as acceptors and concentrate on the study of the power of ITA on n-ary balanced trees (ITA,,) with various types of finite automata—for any 1 <i <n all ith sons of all nodes are  ... 

Page 5694 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
of automata on words.  ...  With every set L of trees one associates the set L of all those trees which, when their only occurrence of a variable is substituted by a con- stant, become a tree of L.  ... 

Implementation and Application of Automata in String Processing [chapter]

Gonzalo Navarro
2009 Lecture Notes in Computer Science  
Alternatively one can omit step (2) and backtrack with the DFA on the suffix tree of the sequence, which leads to sublinear-time complex pattern matching in many relevant cases.  ...  Automata have been enormously successful in matching different types of complex patterns on sequences, with applications in many areas, from text retrieval to bioinformatics, from multimedia databases  ...  Alternatively one can omit step (2) and backtrack with the DFA on the suffix tree of the sequence, which leads to sublinear-time complex pattern matching in many relevant cases.  ... 
doi:10.1007/978-3-642-02979-0_1 fatcat:wq4kdu76sncw3oktj3u72igwo4

Page 4996 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
Indyk, Optimal simulation of automata by neural nets (337-348); Pavol Duris and José D. P. Rolim, Optimal lower bounds on the multiparty communication complexity (350-360); Laszlé Babai, Peter G.  ...  {Most of the papers are being reviewed individually. } 96h:68010 68-06 * Special issue on parallel computing.  ... 
« Previous Showing results 1 — 15 out of 15,608 results