213 search results - page 29 / 43 » Relating Word and Tree Automata |
FSTTCS
2003
Springer
14 years 22 days ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
TCS
2002
13 years 7 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
FORTE
2008
13 years 9 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
LREC
2010
13 years 9 months ago
2010
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...