๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On algebraic and logical specifications of classes of regular languages

โœ Scribed by Bakhadyr Khoussainov

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
231 KB
Volume
298
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speciรฟcations of these classes from algebraic, computational and logical points of view.

๐Ÿ“œ SIMILAR VOLUMES

Logical Complexity of Some Classes of Tr
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata
โœ Wojciech Buszkowski ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ

On Koszul Algebras and a New Constructio
On Koszul Algebras and a New Construction of Artinโ€“Schelter Regular Algebras
โœ Brad Shelton; Craig Tingey ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

We prove the simple fact that the factor ring of a Koszul algebra by a regular, normal, quadratic element is a Koszul algebra. This fact leads to a new construction of quadratic ArtinแŽSchelter regular algebras. This construction generalizes the construction of ArtinแŽSchelter regular Clifford algebra