Automata for solid codes

DOI10.1016/j.tcs.2021.09.007OpenAlexW3200876187MaRDI QIDQ2235761

Ludwig Staiger, Helmut Jürgensen

Publication date: 21 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.007

zbMATH Keywords

finite automatoncodefault-toleranceacceptorstate-invariance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Relativized codes
• Solid codes and disjunctive domains
• Outfix and infix codes and related classes of languages
• Syntaktische Monoide und Hypercodes
• Completing comma-free codes
• The syntactic monoid of a hypercode
• The Mathematical Foundation of Informatics
• OVERLAP-FREE LANGUAGES AND SOLID CODES
• The Syntactic Monoid of an Infix Code
• Overlap-Free Regular Languages
• Involution Solid and Join Codes
• Hypercodes, Right Convex Languages and their Syntactic Monoids
• Efficient string matching
• Jewels of Stringology
• Combinatorial problems motivated by comma‐free codes
• (Near-)inverses of sequences
• Automata for Codes
• Decidability of code properties
• Algorithms on Strings
• Finite maximal solid codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata for solid codes