INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
From MaRDI portal
Publication:5291302
DOI10.1142/S0129054106003887zbMath1093.68051OpenAlexW2069316473MaRDI QIDQ5291302
No author found.
Publication date: 10 May 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054106003887
Related Items (13)
Generalizations of Code Languages with Marginal Errors ⋮ OVERLAP-FREE LANGUAGES AND SOLID CODES ⋮ On the existence of prime decompositions ⋮ Decidability of involution hypercodes ⋮ Extremal minimality conditions on automata ⋮ Length Codes, Products of Languages and Primality ⋮ On Language Decompositions and Primality ⋮ Decision problems for convex languages ⋮ Predictable semiautomata ⋮ Power, positive closure, and quotients on convex languages ⋮ Decision Problems for Convex Languages ⋮ Generalizations of Code Languages with Marginal Errors ⋮ Variants of codes and indecomposable languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata and forbidden words
- Outfix and infix codes and related classes of languages
- Structure of 3-infix-outfix maximal codes.
- n-Prefix–suffix languages∗
- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- Programming Techniques: Regular expression search algorithm
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
This page was built for publication: INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES