Thin and slender languages

DOI10.1016/0166-218X(94)00014-5zbMATH Open0831.68057OpenAlexW2086119518MaRDI QIDQ1897353FDOQ1897353

Authors: Arto Salomaa, Gheorghe Păun 

Publication date: 27 August 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00014-5

Recommendations

• Decision problems concerning thinness and slenderness of formal languages
• Closure properties of slender languages
• scientific article; zbMATH DE number 1156871
• scientific article; zbMATH DE number 1860693
• On slender context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analytic models and ambiguity of context-free languages
• Language-theoretic problems arising from Richelieu cryptosystems

Cited In (42)

• The single loop representations of regular languages
• Min of Mat is not necessarily Mat
• Length considerations in context-free languages
• Title not available (Why is that?)
• RESULTS CONCERNING THINNESS OF D0L LANGUAGES
• Periodic and Sturmian languages
• Remarks on arbitrary multiple pattern interpretations
• Decidability questions related to abstract numeration systems
• On lengths of words in context-free languages
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• On differentiation functions, structure functions, and related languages of context-free grammars
• Word-paired catenations of regular languages
• Language-theoretic complexity of disjunctive sequences
• Succinct representations of languages by DFA with different levels of reliability
• Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
• Decimations of languages and state complexity
• Branching measures and nearly acyclic NFAs
• Restricted use of the splicing operation¹
• Semi-synchronous transductions
• A characterization of poly-slender context-free languages
• Sparse and slender subsets of monoids.
• THE BASE PROBLEM FOR D0L PARIKH SETS
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Orthogonal shuffle on trajectories
• Hairpin structures defined by DNA trajectories
• On counting functions and slenderness of languages
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Formal descriptions of code properties: decidability, complexity, implementation
• A decision method for Parikh slenderness of context-free languages
• Detecting palindromes, patterns and borders in regular languages
• On Parikh slender context-free languages
• Fine covers of a VAS language
• One-dimensional pattern generation by cellular automata
• On the multiplicity equivalence problem for context-free grammars
• On images of D0L and DT0L power series.
• On D0L power series
• Finite Automata, Palindromes, Powers, and Patterns
• Language Decompositions, Primality, and Trajectory-Based Operations
• Title not available (Why is that?)
• Numeration systems, linear recurrences, and regular sets
• Title not available (Why is that?)
• On strongly context-free languages

This page was built for publication: Thin and slender languages

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