14 search results - page 3 / 3 » Church's Problem and a Tour through Automata Theory |
ACL
2010
13 years 2 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
SIGCSE
1994
ACM
13 years 8 months ago
1994
ACM
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing. These tools can be used to understand the ...
PODS
2007
ACM
14 years 4 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...