59 search results - page 7 / 12 » State Complexity of Union and Intersection of Finite Languag... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
AAAI
2000
13 years 9 months ago
2000
We present a general, consistency-based framework for belief change. Informally, in revising K by , we begin with and incorporate as much of K as consistently possible. Formally, ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
ACTA
2010
13 years 7 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
CEC
2003
IEEE
14 years 25 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...