Thin and slender languages
From MaRDI portal
Publication:1897353
DOI10.1016/0166-218X(94)00014-5zbMath0831.68057OpenAlexW2086119518MaRDI QIDQ1897353
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
Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Automata and formal grammars in connection with logical questions (03D05)
Related Items (39)
RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ Decidability questions related to abstract numeration systems ⋮ Word-paired catenations of regular languages ⋮ THE BASE PROBLEM FOR D0L PARIKH SETS ⋮ Periodic and Sturmian languages ⋮ Remarks on arbitrary multiple pattern interpretations ⋮ FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ On differentiation functions, structure functions, and related languages of context-free grammars ⋮ Language-theoretic complexity of disjunctive sequences ⋮ The single loop representations of regular languages ⋮ Numeration systems, linear recurrences, and regular sets ⋮ Length considerations in context-free languages ⋮ Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508 ⋮ On counting functions and slenderness of languages ⋮ On images of D0L and DT0L power series. ⋮ On the multiplicity equivalence problem for context-free grammars ⋮ Restricted use of the splicing operation1 ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS ⋮ One-dimensional pattern generation by cellular automata ⋮ A decision method for Parikh slenderness of context-free languages ⋮ SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES ⋮ Sparse and slender subsets of monoids. ⋮ Succinct representations of languages by DFA with different levels of reliability ⋮ On Parikh slender context-free languages ⋮ It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base ⋮ Hairpin structures defined by DNA trajectories ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ The Critical Exponent is Computable for Automatic Sequences ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ Semi-synchronous transductions ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ Decimations of languages and state complexity ⋮ On strongly context-free languages ⋮ On lengths of words in context-free languages ⋮ On D0L power series ⋮ Detecting palindromes, patterns and borders in regular languages ⋮ A characterization of poly-slender context-free languages ⋮ Min of Mat is not necessarily Mat
Cites Work
This page was built for publication: Thin and slender languages
