| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Formal Languages (F.4.3) > Algebraic Language Theory (F.4.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 39
Reviews about "Algebraic Language Theory (F.4.3...)":
|
Date Reviewed |
| |
The algebra of set functions I: the product theorem and duality
Lass B. European Journal of Combinatorics 33(2): 227-236, 2012. Type: Article
This is the first of a sequence of research reports that attempt to approach the topic of the algebra of set functions in a complete way, and to illustrate its practicality in (re-)defining and (re-)proving results that we might have m...
|
May 24 2012 |
| |
A note on autodense related languages
Fan C., Huang C., Shyr H., Chen K. Acta Informatica 47(4): 209-219, 2010. Type: Article
A formal language is autodense if any word can be modified by a prefix and a suffix to become a member. It is anti-autodense if adjoining a prefix and a suffix to a member always removes it from the language....
|
Oct 13 2010 |
| |
On rational stochastic languages
Denis F., Esposito Y. Fundamenta Informaticae 86(1,2): 41-77, 2008. Type: Article
This paper presents a series of interrelated results on classes of formal power series that are generated by various types of weighted finite automata. In the early 1960s, Schützenberger initiated the idea of studying rational...
|
Jun 5 2009 |
| |
Restarting automata with restricted utilization of auxiliary symbols
Jurdzinski T., Otto F. Theoretical Computer Science 363(2): 162-181, 2006. Type: Article
Restarting automata, which were originally introduced to handle certain problems in the linguistic analysis of natural languages, are considered in this paper for their formal properties. The basic model, the RLWW-automaton, is a nonde...
|
Oct 16 2007 |
| |
Learning in varieties of the form V*LI from positive data
García P., Ruiz J. Theoretical Computer Science 362(1): 100-114, 2006. Type: Article
Grammatical inference refers to the process of learning grammars and languages from data. In literature, it refers to automata induction, grammar induction, and automatic language acquisition. There are applications for machine learnin...
|
Aug 17 2007 |
| |
Axiomatizing the identities of binoid languages
Dolinka I. Theoretical Computer Science 372(1): 1-14, 2007. Type: Article
To understand this paper, it is necessary to appreciate the importance of algebraic dissections of string languages and their significance for theoretical computer science via the inherent links to formal languages and automata....
|
May 29 2007 |
| |
Actions, wreath products of C-varieties and concatenation product
Chaubard L., Pin J., Straubing H. Theoretical Computer Science 356(1): 73-89, 2006. Type: Article
Varieties, as used in formal language theory, are families of languages or algebraic structures that are closed under some operations, typically under finite products and inverse morphisms. Let C define a class of mo...
|
Nov 14 2006 |
| |
Pattern expressions and pattern automata
Câmpeanu C., Yu S. Information Processing Letters 92(6): 267-274, 2004. Type: Article
Efficient and easy to use pattern matching tools are a necessity in several scientific disciplines, for example bioinformatics. These disciplines now rely on tools that are based on regular expressions, and a few improvements, such as ...
|
Apr 15 2005 |
| |
Algebraic theory of automata & languages
Ito M., World Scientific Press, 2004. Type: Book (9789810247270)
In his preface to this volume, the author explains, “The subjects in the book seem to be unique compared to other books with similar titles.” Indeed, readers who are expecting to see a fresh treatment of the materia...
|
Feb 22 2005 |
| |
Subword histories and Parikh matrices
Mateescu A., Salomaa A., Yu S. Journal of Computer and System Sciences 68(1): 1-21, 2004. Type: Article
A subword history is an arithmetic expression involving sums, products, and integer multiples of quantities, representing the number of occurrences, including overlaps, of various subwords of a string. In this context, “subwo...
|
Sep 16 2004 |
| |
|
|
| |
|
|
