On language decompositions and primality

Authors:
Michael Domaratzki;Kai Salomaa
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada;School of Computing, Queen's University, Kingston, Ontario, Canada
Venue:
Rainbow of computer science
Year:
2011

Citing 24
Cited 0

Minimal NFA problems are hard

SIAM Journal on Computing
On language equations with invertible operations

Theoretical Computer Science
Maximal and minimal solutions to language equations

Journal of Computer and System Sciences
Regular languages

Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
Shuffle and scattered deletion closure of languages

Theoretical Computer Science
On Fatou properties of rational languages

Where mathematics, computer science, linguistics and biology meet
Factorizations of languages and commutativity conditions

Acta Cybernetica
Deletion along trajectories

Theoretical Computer Science
Language equations, maximality and error-detection

Journal of Computer and System Sciences
Trajectory-based operations

Trajectory-based operations
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
A Second Course in Formal Languages and Automata Theory

A Second Course in Formal Languages and Automata Theory
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
State complexity of unique rational operations

Theoretical Computer Science
Variants of codes and indecomposable languages

Information and Computation
Decision problems for language equations

Journal of Computer and System Sciences
What do we know about language equations?

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Commutation of binary factorial languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Schema design for XML repositories: complexity and tractability

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic shuffle on and deletion along trajectories

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concatenation of strings and languages is a fundamental operation on formal languages. Here we consider the inverse operation of language decomposition, where we want to represent a given language as a non-trivial concatenation of two languages. The associated notions of prime languages and prime decompositions have been originally introduced by Mateescu, A. Salomaa and Yu. We consider also extensions of the decomposability problem with respect to orthogonal concatenation, as well as, more general operations defined by sets of trajectories.