Sciweavers

815 search results - page 9 / 163
» Algebraic Recognizability of Languages
Sort
View
LFCS
2009
Springer
15 years 4 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
DBPL
2007
Springer
91views Database» more  DBPL 2007»
15 years 6 months ago
Relational Completeness of Query Languages for Annotated Databases
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
Floris Geerts, Jan Van den Bussche
CONCUR
2009
Springer
15 years 3 months ago
Algebra for Infinite Forests with an Application to the Temporal Logic EF
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
Mikolaj Bojanczyk, Tomasz Idziaszek
TCS
1998
14 years 11 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen
POPL
2010
ACM
15 years 9 months ago
Decision Procedures for Algebraic Data Types with Abstractions
Philippe Suter, Mirco Dotta, Viktor Kuncak