Results 11  20
of
208
Behavioural Differential Equations: A Coinductive Calculus of Streams, Automata, and Power Series
, 2000
"... Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduct ..."
Abstract

Cited by 73 (26 self)
 Add to MetaCart
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs
Dense Quantum Coding and Quantum Finite Automata
, 2002
"... We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from the original m bits can be recovered with good probability. We show that nontrivial quantum codes exist that have no classical counterparts. On the other hand, we show that ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
that quantum encoding cannot save more than a logarithmic additive factor over the best classical encoding. The proof is based on an entropy coalescence principle that is obtained by viewing Holevo's theorem from a new perspective. In the
Models of Quantum Cellular Automata
, 2005
"... In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different QCA models, and compare them. One model we discuss is the trad ..."
Abstract
 Add to MetaCart
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different QCA models, and compare them. One model we discuss
Algebraic Constraints, Automata, and Regular Languages
, 2000
"... A class of decision problems is Boolean if it is closed under the settheoretic operations of union, intersection and complementation. The paper introduces new Boolean classes of decision problems based on algebraic constraints imposed on transitions of finite automata. We discuss issues related ..."
Abstract
 Add to MetaCart
related to specifications of these classes from algebraic, computational and prooftheoretic points of view.
Propositional Proof Complexity and Rewriting
, 2008
"... In this work we want to find a new framework for propositional proofs (and in particular for resolution proofs) utilizing rewriting techniques. We interpret the wellknown propositional proof system resolution using string rewriting systems (semiThue system [70], [71]) Σ ∗ n and Σn corresponding to ..."
Abstract
 Add to MetaCart
In this work we want to find a new framework for propositional proofs (and in particular for resolution proofs) utilizing rewriting techniques. We interpret the wellknown propositional proof system resolution using string rewriting systems (semiThue system [70], [71]) Σ ∗ n and Σn corresponding
From multi to single stack automata
 In Proc. of CONCUR 2010, volume 6269 of LNCS
, 2010
"... Abstract. Verification of concurrent programs modelled as multistack machines is an active research area. Recently decidability/complexity results have been established for powerful models such as boundedphase visibly pushdown automata (BVMPA) [16] and ordered multipushdown automata (OMPA) [1]. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Verification of concurrent programs modelled as multistack machines is an active research area. Recently decidability/complexity results have been established for powerful models such as boundedphase visibly pushdown automata (BVMPA) [16] and ordered multipushdown automata (OMPA) [1
A unified construction of the Glushkov, follow and Antimirov automata
 Lecture Notes in Computer Science 4162 (2006
"... Abstract. Many techniques have been introduced in the last few decades to create free automata representing regular expressions: Glushkov automata, the socalled follow automata, and Antimirov automata. This paper presents a simple and unified view of all these free automata both in the case of u ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. Many techniques have been introduced in the last few decades to create free automata representing regular expressions: Glushkov automata, the socalled follow automata, and Antimirov automata. This paper presents a simple and unified view of all these free automata both in the case
Quantum groups, the loop Grassmannian, and the Springer resolution
 J. Amer. Math. Soc
"... We establish equivalences of the following three triangulated categories: Dquantum(g) ← → D G coherent (Ñ) ← → Dperverse(Gr). Here, Dquantum(g) is the derived category of the principal block of finite dimensional representations of the quantized enveloping algebra (at an odd root of unity) of a comp ..."
Abstract

Cited by 48 (11 self)
 Add to MetaCart
variety. The equivalence between Dperverse(Gr) and DG coherent (Ñ) can be viewed as a ‘categorification ’ of the isomorphism between two completely different geometric realizations of the (fundamental polynomial representation of the) affine Hecke algebra that has played a key role in the proof
Search Strategies for Resolution in Temporal Logics
 Proceedings of the Thirteenth International Conference on Automated Deduction (CADE
, 1996
"... . In this paper we give and evaluate the algorithms for a fully automated temporal resolution theorem prover. An approach to applying resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. As the application of the temporal resolutio ..."
Abstract

Cited by 25 (12 self)
 Add to MetaCart
and verification of properties of concurrent systems, see for example [Hai82, Lam83, MP92]. However proof procedures for such logics have tended to be tableau [Wol85, Gou84] or automata [VW86] based rather than based on resolution [Rob65]. In many cases the resolution based decision procedures that have been
Visualising FirstOrder Proof Search
, 2005
"... This paper describes a method for visualising proof search in automatic resolutionstyle firstorder theorem provers. The method has been implemented in a simple tool called viz, which takes advantage of the widelysupported scalar vector graphics format to produce graphs which can be viewed interac ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes a method for visualising proof search in automatic resolutionstyle firstorder theorem provers. The method has been implemented in a simple tool called viz, which takes advantage of the widelysupported scalar vector graphics format to produce graphs which can be viewed
Results 11  20
of
208