scientific article; zbMATH DE number 3673546

MaRDI QIDQ3870326zbMATH OpenFDO

Authors Karel II Culik, Hermann Maurer

Publication date 1979

Full work available at URL https://eudml.org/doc/92102

zbMATH Keywords

characterization of families of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A generator of context-sensitive languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Comparing complexity classes
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3324737 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On some families of languages related to developmental systems
• Propagating chain-free normal forms for EOL systems
• The Hardest Context-Free Language

Cited in

(17)

• Remarks on multihead pushdown automata and multihead stack automata
• An inverse homomorphic characterization of full principal AFL
• On morphic generation of regular languages
• Representations of language families by homomorphic equality operations and generalized equality sets
• Bifaithful starry transductions
• Test sets and checking words for homomorphism equivalence
• A homomorphic characterization of regular languages
• A note on morphic characterization of languages
• Hardest languages for conjunctive and Boolean grammars
• Finite transducers and rational transductions
• On hardest languages for one-dimensional cellular automata
• A homomorphic characterization of time and space complexity classes of languages†
• The hardest language for conjunctive grammars
• The hardest language for grammars with context operators
• The Hardest LL(k) Language
• On hardest languages for one-dimensional cellular automata
• The hardest \(\operatorname{LL}(k)\) language

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 Q3870326)