759 search results - page 84 / 152 » Overlap-Free Regular Languages |
FOSSACS
2000
Springer
15 years 1 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
104
click to vote
ACL
1992
14 years 11 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
181
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Newborns must learn to structure incoming acoustic information into segments, words, phrases, etc., before they can start to learn language. This process is thought to rely on mod...