206 search results - page 15 / 42 » Weak Alternating Automata Are Not That Weak |
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
ATVA
2004
Springer
14 years 29 days ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
IJFCS
2006
13 years 7 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
HICSS
2003
IEEE
14 years 26 days ago
2003
IEEE
Case-based reasoning and multicriteria decision making have common grounds: they are both problem solving methodologies; both involve the selection, ranking and aggregation of bes...
ECCC
2000
13 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...