scientific article; zbMATH DE number 3413820
From MaRDI portal
Publication:5678435
zbMath0262.68025MaRDI QIDQ5678435
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (only showing first 100 items - show all)
Pattern expressions and pattern automata ⋮ DNA splicing: Computing by observing ⋮ Regulated nondeterminism in pushdown automata ⋮ Periodic and Sturmian languages ⋮ Programmed grammars and their relation to the LBA problem ⋮ Incremental construction of minimal deterministic finite cover automata ⋮ Restarting automata with restricted utilization of auxiliary symbols ⋮ A note on ambiguity of internal contextual grammars ⋮ Fuzzy \(h\)-ideals of hemirings. ⋮ Languages generated by iterated idempotency ⋮ Some remarks about the efficiency of polyautomata ⋮ Universality results for P systems based on brane calculi operations ⋮ On the power of permitting features in cooperating context-free array grammar systems ⋮ Computing by observing: simple systems and simple observers ⋮ Scattered context grammars generate any recursively enumerable language with two nonterminals ⋮ Boundary sets of regular and context-free languages ⋮ Block insertion and deletion on trajectories ⋮ Büchi context-free languages ⋮ Reaction automata ⋮ An infinite hierarchy of languages defined by dP systems ⋮ A \(P\) system model with pure context-free rules for picture array generation ⋮ The complexity of regular DNLC graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ Complexity and decidability for restricted classes of picture languages ⋮ Workspace theorems for regular-controlled grammars ⋮ The congruence theory of closure properties of regular tree languages ⋮ A note on algebras of languages ⋮ Quasi-rocking real-time pushdown automata ⋮ The Boolean closure of linear context-free languages ⋮ Spiking neural P systems with extended rules: universality and languages ⋮ Structural equivalence and ET0L grammars ⋮ Nonreturning PC grammar systems can be simulated by returning systems ⋮ Pattern systems ⋮ On the index of positive programmed formal languages ⋮ Contextual array grammars and array P systems ⋮ Multi-pattern languages ⋮ A decision method for Parikh slenderness of context-free languages ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ Membrane systems with proteins embedded in membranes ⋮ Decision problems in membrane systems with peripheral proteins, transport and evolution ⋮ Counter machines, Petri nets, and consensual computation ⋮ Language-theoretic problems arising from Richelieu cryptosystems ⋮ T-structures, T-functions, and texts ⋮ Equations over finite sets of words and equivalence problems in automata theory ⋮ On the union of 0L languages ⋮ Infinite games with finite knowledge gaps ⋮ Enhanced mobile membranes: computability results ⋮ Pure 2D picture grammars and languages ⋮ Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources ⋮ Decidability of operation problems for T0L languages and subclasses ⋮ Bounded hairpin completion ⋮ Mutual mobile membranes with objects on surface ⋮ Theoretical and computational properties of transpositions ⋮ Trading polarizations for labels in P systems with active membranes ⋮ Left-forbidding cooperating distributed grammar systems ⋮ Adding symbolic information to picture models: definitions and properties ⋮ On the properties of language classes defined by bounded reaction automata ⋮ P automata revisited ⋮ Membership for growing context-sensitive grammars is polynomial ⋮ Basic tree transducers ⋮ On the descriptional complexity of scattered context grammars ⋮ Membrane computing with transport and embedded proteins ⋮ Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way ⋮ On the closure of pattern expressions languages under intersection with regular languages ⋮ An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations ⋮ On the intersection of regex languages with regular languages ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ Priorities on context conditions in rewriting systems ⋮ Rewriting systems with a clocking mechanism ⋮ Self-assembly of strings and languages ⋮ On regularity of context-free languages ⋮ Nivat's processing systems: decision problems related to protection and synchronization ⋮ One-sided random context grammars ⋮ Experiments on the reliability of stochastic spiking neural P systems ⋮ On input-revolving deterministic and nondeterministic finite automata ⋮ Equality sets of prefix morphisms and regular star languages ⋮ Some remarks on non-algebraic adherences ⋮ L codes and number systems ⋮ Subset languages of Petri nets. I: The relationship to string languages and normal forms ⋮ Real functions and numbers defined by Turing machines ⋮ On DOS languages and DOS mappings ⋮ Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 ⋮ On simulation and propagating EOL forms ⋮ Analyse numérique du problème des ondes longues en eau peu profonde ⋮ Init and Anf operating on \(\omega\)-languages ⋮ Homomorphic images of sentential form languages defined by semi-Thue systems ⋮ Context-free grammar forms with strict interpretations ⋮ On inherently ambiguous E0L languages ⋮ Iterative tree automata ⋮ Linear indexed languages ⋮ On the ratio of growth functions in EDTOL languages ⋮ Subset languages of Petri nets. II. Closure properties ⋮ Practical LL(1)-based parsing of van Wijngaarden grammars ⋮ Bases and ambiguity of number systems ⋮ Commutative one-counter languages are regular ⋮ An efficient recognizer for the Boolean closure of context-free languages ⋮ Many aspects of formal languages ⋮ Decidability of structural equivalence of E0L grammars ⋮ Formal languages and global cellular automaton behavior ⋮ On bounded interpretations of grammar forms
This page was built for publication:
