2465 search results - page 142 / 493 » Automata on Linear Orderings |
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
CICLING
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...