Language Decompositions, Primality, and Trajectory-Based Operations

Authors:
Kai Salomaa
Affiliations:
School of Computing, Queen's University, Kingston, Canada K7L 3N6
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 8
Cited 0

Thin and slender languages

Discrete Applied Mathematics
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
Factorizations of languages and commutativity conditions

Acta Cybernetica
Deletion along trajectories

Theoretical Computer Science
Decidability of trajectory-based equations

Theoretical Computer Science - Mathematical foundations of computer science 2004
Aspects of shuffle and deletion on trajectories

Theoretical Computer Science
Interpreted Trajectories

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the existence of prime decompositions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the decomposability of languages and the notion of primality with respect to catenation, as well as, more general operations. We survey recent results and discuss open problems.