205 search results - page 17 / 41 » Testing the Equivalence of Regular Languages |
COGSCI
2011
14 years 4 months ago
2011
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
69
Voted
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
75
Voted
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
77
Voted
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
ICST
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...