State complexity of deletion and bipolar deletion
From MaRDI portal
Publication:5963404
DOI10.1007/s00236-015-0245-yzbMath1335.68121OpenAlexW796701085MaRDI QIDQ5963404
Sang-Ki Ko, Kai Salomaa, Yo-Sub Han
Publication date: 19 February 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1974/15961
Related Items
Nondeterministic state complexity of site-directed deletion, The nondeterministic state complexity of the site-directed deletion language operation, State Complexity of Insertion, Further closure properties of input-driven pushdown automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of combined operations for suffix-free regular languages
- State complexity of combined operations with two basic operations
- Descriptional and computational complexity of finite automata -- a survey
- Deletion along trajectories
- On the state complexity of reversals of regular languages
- On deterministic finite automata and syntactic monoid size
- The state complexity of \(L^{2}\) and \(L^k\)
- State complexity of power
- State complexity of basic operations on suffix-free regular languages
- Shuffle on trajectories: Syntactic constraints
- The state complexities of some basic operations on regular languages
- On language equations with invertible operations
- Aspects of shuffle and deletion on trajectories
- State complexity of combined operations
- Decidability of trajectory-based equations
- State Complexity of Basic Operations on Non-returning Regular Languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- The State Complexity of Star-Complement-Star
- A Second Course in Formal Languages and Automata Theory
- STATE COMPLEXITY AND APPROXIMATION
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
- State Complexity of Inversion Operations
- Operational State Complexity under Parikh Equivalence
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
