1054 search results - page 5 / 211 » A Formalization of the Turing Test |
CIE
2006
Springer
15 years 3 months ago
2006
Springer
COMPUTER
1999
15 years 3 months ago
1999
125
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
123
Voted
SIGCSE
2006
ACM
15 years 9 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...