815 search results - page 85 / 163 » Algebraic Recognizability of Languages |
172
click to vote
ENTCS
2010
15 years 6 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
155
click to vote
RML
2002
15 years 5 months ago
2002
In E-commerce processes, various rules and constraints regarding product specifications, pricing, terms and conditions are exchanged between vendors and buyers. Developing a forma...
145
click to vote
ICFP
1996
ACM
15 years 10 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
165
click to vote
JMLC
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We describe a system designed to provide database programming support for Oberon programmers. The system is based on a generic object-oriented data model which supports r...
161
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...