Sciweavers

59 search results - page 9 / 12
» State Complexity of Union and Intersection of Finite Languag...
Sort
View
EMNLP
2011
12 years 7 months ago
Hierarchical Phrase-based Translation Representations
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
Gonzalo Iglesias, Cyril Allauzen, William Byrne, A...
FOIS
2006
13 years 9 months ago
Formalizing Ontology Alignment and its Operations with Category Theory
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
Antoine Zimmermann, Markus Krötzsch, Jé...
AGENTCL
2000
Springer
13 years 12 months ago
Using Colored Petri Nets for Conversation Modeling
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversation-based approach is largely determined by the conversational mod...
R. Scott Cost, Ye Chen, Timothy W. Finin, Yannis L...
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
13 years 11 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
ENTCS
2006
155views more  ENTCS 2006»
13 years 7 months ago
Biomolecular Agents as Multi-behavioural Concurrent Objects
In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-ca...
Denys Duchier, Céline Kuttler