scientific article; zbMATH DE number 3569855
From MaRDI portal
Publication:4140407
zbMath0365.68072MaRDI QIDQ4140407
Arto Salomaa, Grzegorz Rozenberg
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Recurrent words and simultaneous growth in T0L systems ⋮ On coordinated selective substitutions: Towards a unified theory of grammars and machines ⋮ Pattern selector grammars and several parsing algorithms in the context- free style ⋮ Applications of scheduling theory to formal language theory ⋮ On erasing in E0L forms ⋮ Context dependent table matrix L systems ⋮ Concerning two-adjacent context-free languages ⋮ String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing ⋮ A powerful abelian square-free substitution over 4 letters ⋮ The equivalence of finite valued transducers (on HDT0L languages) is decidable ⋮ Periodic D0L languages ⋮ Balance of many-valued transductions and equivalence problems ⋮ Remarks on arbitrary multiple pattern interpretations ⋮ Bounded D0L languages ⋮ On a public-key cryptosystem based on iterated morphisms and substitutions ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ C-tree systolic automata ⋮ On the length of word chains ⋮ Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length) ⋮ The finiteness of synchronous, tabled picture languages is decidable ⋮ A defect property of codes with unbounded delays ⋮ A representation of recursively enumerable languages by two homomorphisms and a quotient ⋮ A cryptanalytic observation concerning systems based on language theory ⋮ On the subword complexity of m-free DOL languages ⋮ Bounds for the D0L language equivalence problem ⋮ On some decidability problems for HDOL systems with nonsingular Parikh matrices ⋮ On commutative DTOL systems ⋮ Observations concerning a public-key cryptosystem based on iterated morphisms ⋮ On the degree of synchronization of k1TOL and k1ETOL systems ⋮ The generating function of the number of subpatterns of a DOL sequence ⋮ Many-to-one simulation in EOL forms is decidable ⋮ Persistent ETOL systems ⋮ Mots sans carre et morphismes iterés ⋮ Synchronized and desynchronized EOL forms ⋮ Towards bridging two cell-inspired models: P systems and R systems ⋮ Test sets and checking words for homomorphism equivalence ⋮ On ambiguity in EOL systems ⋮ A \(P\) system model with pure context-free rules for picture array generation ⋮ Sur les séries associees à certains systèmes de Lindenmayer ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ On the emptiness of the intersection of two DOS languages problem ⋮ On pure, terminal invariant and nonterminal invariant interpretations of EOL forms ⋮ Periodic string division generated by deterministic L systems ⋮ Bispecial factors in circular non-pushy D0L languages ⋮ New techniques for proving the decidability of equivalence problem ⋮ A model for developmental systems. I: Generating word without any operating system ⋮ An algorithm for enumerating all infinite repetitions in a D0L-system ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Structural equivalence and ET0L grammars ⋮ Quasi-deterministic 0L systems and their representation ⋮ Pattern systems ⋮ Multi-pattern languages ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ A decision method for Parikh slenderness of context-free languages ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ Equations over finite sets of words and equivalence problems in automata theory ⋮ On the union of 0L languages ⋮ The minimum substring cover problem ⋮ Pure 2D picture grammars and languages ⋮ Decidability of operation problems for T0L languages and subclasses ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ The generative capacity of block-synchronized context-free grammars ⋮ The bounded degree problem for NLC grammars is decidable ⋮ Basic tree transducers ⋮ Regularity of sets of initial strings of periodic D0L-systems ⋮ The goodness of \(\{S,a\}\)-EOL forms is decidable ⋮ Hierarchical resolution of power spectra ⋮ A new pumping lemma for indexed languages, with an application to infinite words ⋮ The effective entropies of some extensions of context-free languages ⋮ The class of HDT0L sequences is closed with respect to rational functions ⋮ Systems of equations over a free monoid and Ehrenfeucht's conjecture ⋮ L codes and number systems ⋮ Studies in uniformity ⋮ On simulation and propagating EOL forms ⋮ Stability of desynchronized 0L-systems ⋮ Homomorphic images of sentential form languages defined by semi-Thue systems ⋮ Synchronized EOL forms ⋮ On binary equality sets and a solution to the test set conjecture in the binary case ⋮ On subword complexity functions ⋮ On inherently ambiguous E0L languages ⋮ The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids ⋮ On the subword complexity of DOL languages with a constant distribution ⋮ Code properties and homomorphisms of DOL systems ⋮ Hierarchies of hyper-AFLs ⋮ An inverse homomorphic characterization of full principal AFL ⋮ On k-repetition freeness of length uniform morphisms over a binary alphabet ⋮ On a family of L languages resulting from systolic tree automata ⋮ Inverse morphic equivalence on languages ⋮ On test sets for checking morphism equivalence on languages with fair distribution of letters ⋮ Fair derivations in E0L systems ⋮ Extended macro grammars and stack controlled machines ⋮ Periodicity and ultimate periodicity of D0L systems ⋮ Decidability of structural equivalence of E0L grammars ⋮ On standard locally catenative L schemes ⋮ Test sets for morphisms with bounded delay ⋮ The undecidability of form equivalence for context-free and EOL forms ⋮ On the power of synchronization in parallel computations ⋮ On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages ⋮ Adherences of DOL languages
This page was built for publication:
