scientific article

zbMath0432.68052MaRDI QIDQ3870326

Karel II Culik, Hermann Maurer

Publication date: 1979

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

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

zbMATH Keywords

characterization of families of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing complexity classes
• A generator of context-sensitive languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• On some families of languages related to developmental systems
• Propagating chain-free normal forms for EOL systems
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• The Hardest Context-Free Language