On language equations with invertible operations
Theoretical Computer Science
Maximal and minimal solutions to language equations
Journal of Computer and System Sciences
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
Automata, Boolean matrices, and ultimate periodicity
Information and Computation
Quotients of Context-Free Languages
Journal of the ACM (JACM)
Shuffle and scattered deletion closure of languages
Theoretical Computer Science
On fairness of many-dimensional trajectories
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Varieties Of Formal Languages
Shuffle on Trajectories: The Schützenberger Product and Related Operations
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Formal and natural computing
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On Regularity-Preserving Functions
On Regularity-Preserving Functions
Regularity preserving functions
ACM SIGACT News
Correction to "Regularity preserving functions"
ACM SIGACT News
Trajectory-based embedding relations
Fundamenta Informaticae
On properties of bond-free DNA languages
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
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Language Decompositions, Primality, and Trajectory-Based Operations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Block insertion and deletion on trajectories
Theoretical Computer Science
On language decompositions and primality
Rainbow of computer science
Substitutions, trajectories and noisy channels
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Trajectory-Based Embedding Relations
Fundamenta Informaticae
| Hi-index | 5.23 |
We describe a new way to model deletion operations on formal languages, called deletion along trajectories. We examine its closure properties, which differ from those of shuffle on trajectories, previously introduced by Mateescu et al. In particular, we define classes of nonregular sets of trajectories such that the associated deletion operation preserves regularity. Our results give uniform proofs of closure properties of the regular languages for several deletion operations.We also show that deletion along trajectories serves as an inverse to shuffle on trajectories. This leads to results on the decidability of certain language equations, including those of the form LTX = R, where L,R are regular languages and X is unknown.