On language equations with invertible operations
From MaRDI portal
Publication:1334659
DOI10.1016/0304-3975(94)90230-5zbMath0821.68075OpenAlexW2056385879MaRDI QIDQ1334659
Publication date: 25 September 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90230-5
Related Items (24)
Equations over sets of integers with addition only ⋮ SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED ⋮ Deletion along trajectories ⋮ On codes defined by bio-operations ⋮ Block insertion and deletion on trajectories ⋮ State Complexity of Insertion ⋮ On the complexity and decidability of some problems involving shuffle ⋮ Closure and decidability properties of some language classes with respect to ciliate bio-operations. ⋮ BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS ⋮ On Language Decompositions and Primality ⋮ Language equations, maximality and error-detection ⋮ Aspects of shuffle and deletion on trajectories ⋮ New types of automata to solve fixed point problems ⋮ On properties of bond-free DNA languages ⋮ State complexity of deletion and bipolar deletion ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS ⋮ State complexity of unique rational operations ⋮ K-catenation and applications:k-prefix codes ⋮ MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES ⋮ NOTES ON DUAL CONCATENATION ⋮ Language equations ⋮ Site-directed insertion: language equations and decision problems ⋮ Decidability of trajectory-based equations
Cites Work
This page was built for publication: On language equations with invertible operations
