205 search results - page 15 / 41 » Testing the Equivalence of Regular Languages |
ESOP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
100
click to vote
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
ALT
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
DBPL
2005
Springer
15 years 3 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...