Publication:5963404

DOI10.1007/S00236-015-0245-YzbMATH Open1335.68121OpenAlexW796701085MaRDI QIDQ5963404FDOQ5963404

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The state complexities of some basic operations on regular languages
• On the state complexity of reversals of regular languages
• On language equations with invertible operations
• Decidability of trajectory-based equations
• A Second Course in Formal Languages and Automata Theory
• Descriptional and computational complexity of finite automata -- a survey
• Shuffle on trajectories: Syntactic constraints
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• State complexity of power
• State complexity of basic operations on suffix-free regular languages
• State complexity of combined operations
• 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
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
• The state complexity of \(L^{2}\) and \(L^k\)
• State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
• On deterministic finite automata and syntactic monoid size
• Deletion along trajectories
• Aspects of shuffle and deletion on trajectories
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• STATE COMPLEXITY AND APPROXIMATION
• Operational State Complexity under Parikh Equivalence
• State Complexity of Basic Operations on Non-returning Regular Languages
• The State Complexity of Star-Complement-Star
• State Complexity of Inversion Operations

Cited In (5)

• State Complexity of Deletion
• 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

This page was built for publication: State complexity of deletion and bipolar deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963404)