Sciweavers

478 search results - page 2 / 96
» Monads of Regular Theories
Sort
View
ACL
1998
13 years 10 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 24 days ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
CALCO
2009
Springer
163views Mathematics» more  CALCO 2009»
14 years 3 months ago
Algebras for Parameterised Monads
Abstract. Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monad...
Robert Atkey
IANDC
2010
107views more  IANDC 2010»
13 years 5 months ago
Equational properties of iterative monads
Iterative monads of Calvin Elgot were introduced to treat the semantics of recursive equations purely algebraically. They are Lawvere theories with the property that all ideal sys...
Jirí Adámek, Stefan Milius, Jiri Vel...
DIAGRAMS
2008
Springer
13 years 10 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson