Sciweavers

662 search results - page 91 / 133
» Trees, Automata and XML
Sort
View
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
16 years 10 days ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
DOCENG
2005
ACM
15 years 8 months ago
Enhancing composite digital documents using XML-based standoff markup
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
Peter L. Thomas, David F. Brailsford
ASE
2002
160views more  ASE 2002»
15 years 5 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
IJFCS
2008
63views more  IJFCS 2008»
15 years 6 months ago
How to Synchronize the Activity of All Components of a P System?
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
Francesco Bernardini, Marian Gheorghe, Maurice Mar...
TCS
2010
15 years 22 days ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet