scientific article; zbMATH DE number 1528682

MaRDI QIDQ4515265zbMATH OpenFDO

Authors Pál Dömösi

Publication date 13 November 2000

zbMATH Keywords

combinatorics on words and languagesformal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Context-free languages and primitive words
• On automaton determinisation of sets of superwords
• scientific article; zbMATH DE number 2150276
• On strongly context-free languages
• Finite-word hyperlanguages
• On context-free and Szilard languages
• Approximation of sets of superwords by L-language formulas
• scientific article; zbMATH DE number 4035186
• Context-Free Languages of Countable Words
• Complexity of Infimal Observable Superlanguages

Cited in

(4)

• A context-free language decision problem
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
• scientific article; zbMATH DE number 1836426 (Why is no real title available?)
• Approximation of sets of superwords by L-language formulas

This page was built for publication:

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