Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  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 116 Reviews about "Algebraic Language Theory (F.4.3...)": Date Reviewed
   Understanding visualization: a formal approach using category theory and semiotics
Vickers P., Faith J., Rossiter N.  IEEE Transactions on Visualization and Computer Graphics 19(6): 1048-1061, 2013. Type: Article

The authors of this paper present a simple, elegant top-level business model of visualization using a combination of basic concepts from semiotics and category theory. The model may be used as a framework for understanding visualization and reason...

Dec 3 2013
  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 missed in the...

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 languages in te...

Jun 5 2009
  A new definition of fuzzy compactness
Shi F.  Fuzzy Sets and Systems 158(13): 1486-1495, 2007. Type: Article

Shi studies the topic of fuzzy compactness in L-topological spaces. For complete DeMorgan algebras (L,∨,∧,’) fuzzy compactness is defined as follows. If (
Nov 13 2007
  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 nondeterministic ...

Oct 16 2007
  Engineering a BPEL orchestration engine as a multi-agent system
Viroli M., Denti E., Ricci A.  Science of Computer Programming 66(3): 226-245, 2007. Type: Article

It is simple to use and coordinate one Web service: you send a request, it is executed, and everybody is happy. In the world of Web services, however, coordinating the execution of multiple Web services is a challenging task. There have been spora...

Sep 24 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 learning in syntact...

Aug 17 2007
  One head machines from a symbolic approach
Gajardo A., Mazoyer J.  Theoretical Computer Science 370(1-3): 34-47, 2007. Type: Article

This paper proposes a new computing machine model, a modified Turing machine, and studies properties of the proposed model. The major modification the authors propose is to allow for a tape in the form of a Cayley graph. In other words, their new ...

Jun 1 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
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy