209 search results - page 5 / 42 » Regular Languages and Associative Language Descriptions |
LATA
2012
Springer
12 years 3 months ago
2012
Springer
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
SIGSOFT
2000
ACM
13 years 12 months ago
2000
ACM
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object "protocols," i.e., sequencing constra...
COMPSAC
2008
IEEE
14 years 1 months ago
2008
IEEE
In the state-of-the-art hardware/software (HW/SW) codesign of embedded systems, there is a lack of sufficient support for architectural specifications across HW/SW boundaries. S...
EACL
2003
ACL Anthology
13 years 9 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
WIA
2000
Springer
13 years 11 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...