644 search results - page 46 / 129 » Precedence Automata and Languages |
100
click to vote
IANDC
2008
14 years 11 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
CSR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
197
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
ICECCS
2005
IEEE
15 years 5 months ago
2005
IEEE
When designing a complex system, Object-Z is a powerful logic-based language for modeling the system state aspects, and Timed Automata is an excellent graph-based notation for cap...
IFIP
1994
Springer
15 years 3 months ago
1994
Springer
Focusing on examples of knowledge systems and machine learning, this paper illustrates the transfer of AI technology from science to real-world applications. Decades of AI researc...