Formal languages
On language equations with invertible operations
Theoretical Computer Science
Theoretical Computer Science
Handbook of formal languages, vol. 1
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Aspects of classical language theory
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Quotients of Context-Free Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Theoretical Computer Science
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
Schema for parallel insertion and deletion
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Hi-index | 5.23 |
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel syntactical constraint provided by trajectories, these operations properly generalize several sequential as well as parallel binary language operations such as catenation, sequential insertion, k-insertion, parallel insertion, quotient, sequential deletion, k-deletion, etc. We establish some relationships between the new operations and shuffle and deletion on trajectories, and obtain several closure properties of the families of regular and context-free languages under the new operations. Moreover, we obtain several decidability results of three types of language equation problems which involve the new operations. The first one is to answer, given languages L"1,L"2,L"3 and a trajectory set T, whether the result of an operation between L"1 and L"2 on the trajectory set T is equal to L"3. The second one is to answer, for three given languages L"1,L"2,L"3, whether there exists a set of trajectories such that the block insertion or deletion between L"1 and L"2 on this trajectory set is equal to L"3. The third problem is similar to the second one, but the language L"1 is unknown while languages L"2,L"3 as well as a trajectory set T are given.