scientific article; zbMATH DE number 7584602

MaRDI QIDQ5867523

Kai Salomaa, Oliver A. S. Lyon

Publication date: 14 September 2022

Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-187-197.php

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite automatonnondeterministic state complexityfooling setbio-inspired language operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The nondeterministic state complexity of the site-directed deletion language operation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptional and computational complexity of finite automata -- a survey
• Contextual insertions/deletions and computability
• Partial orders on words, minimal elements of regular languages, and state complexity
• Self-assembly of strings and languages
• Intersection and union of regular languages and state complexity
• On the computational power of insertion-deletion systems
• State complexity of overlap assembly
• Outfix-guided insertion
• On the overlap assembly of strings and languages
• Site-directed insertion: language equations and decision problems
• The chop of languages
• State Complexity of Insertion
• A Second Course in Formal Languages and Automata Theory
• Descriptional Complexity of Chop Operations on Unary and Finite Languages.

This page was built for publication: