scientific article; zbMATH DE number 3509706
From MaRDI portal
Publication:4089754
zbMath0325.68002MaRDI QIDQ4089754
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Sur la structure des langages algébriques, Some formal results about stratificational grammars and their relevance to linguistics, Transductions and the parallel generation of languages†, Unnamed Item, SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED, Normal forms for phrase-structure grammars, Unnamed Item, On the usefulness of bifaithful rational cones, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, HYBRID EXTENDED FINITE AUTOMATA, Uniform simulations of nondeterministic real time multitape turing machines, Unnamed Item, On Usefulness of Information: Framework and NFA Case, Iterated linear control and iterated one-turn pushdowns, A new normal form for the compositions of morphisms and inverse morphisms, Unnamed Item, Unnamed Item, Learning two-tape automata from queries and counterexamples, Deterministic Input-Reversal and Input-Revolving Finite Automata, Complete symmetry in d2l systems and cellular automata, Quotient and bounded context-free languages, On some transducer equivalence problems for families of languages, Unnamed Item, The algebraic equivalent of AFL theory, Continuous operations on languages, On characterisation of language families in terms of inverse morphisms, Variations of checking stack automata: obtaining unexpected decidability properties, Gaining Power by Input Operations: Finite Automata and Beyond, On Computational Properties of Template-Guided DNA Recombination, Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables, FORMAL MODELLING OF VIRAL GENE COMPRESSION, Compelled operations and operations of degreeP, On Families of Full Trios Containing Counter Machine Languages, Unnamed Item, Abstract families of context-free grammars, A remark about a substitution property, On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L, Unnamed Item, Languages, Decidability, and Complexity, Invito alla teoria dei linguaggi formali, Conversion of regular expressions into realtime automata, Three hierarchies of transducers, Semilinearity of Families of Languages, A note on non-generators of full afl's, Some hierarchies for the communication complexity measures of cooperating grammar systems, The chop of languages, On coordinated selective substitutions: Towards a unified theory of grammars and machines, On language equations with invertible operations, CTS systems and Petri nets, Morphic congruences and D0L languages, Infinite unfair shuffles and associativity, On commutative context-free languages, On the intersection of the class of linear context-free languages and the class of single-reset languages, Reversal-bounded nondeterministic multicounter machines and complementation, Literal shuffle, Representations of language families by homomorphic equality operations and generalized equality sets, Subword topology, Well-structured languages, Closure property of principal cones under substitution, A representation of recursively enumerable languages by two homomorphisms and a quotient, Families of languages defined by ciliate bio-operations, Branching synchronization grammars with nested tables, Context-sensitive string languages and recognizable picture languages, The emptiness problem for valence automata over graph monoids, On the intersection of stacks and queues, Deletion operations on deterministic families of automata, Prefix and equality languages of rational functions are co-context-free, On the splicing operation, Remarks on regulated limited ET0L systems and regulated context-free grammars, Cônes rationnels commutatifs, Recursivite et cônes rationnels fermés par intersection, Rational bijection of rational sets, Codeterministic Lindenmayer schemes and systems, On counting functions and slenderness of languages, On-line n-bounded multicounter automata, Persistent ETOL systems, On generators and generative capacity of EOL forms, A-transducers and the monotonicity of IL schemes, Multiple equality sets and Post machines, A propos du lemme de substitution, Substitution of semi-AFL's, Position-restricted grammar forms and grammars, Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems), The power of synchronizing operations on strings, On nonstochastic languages and homomorphic images of stochastic languages, Langages satures et cônes decroissants. Langages et cônes bifideles, Closure and decidability properties of some language classes with respect to ciliate bio-operations., A result concerning the trios generated by commutative SLIP-languages, Refining the hierarchy of blind multicounter languages and twist-closed trios., Abstract grammars based on transductions, Budget-bounded model-checking pushdown systems, QRT FIFO automata, breadth-first grammars and their relations, Iterated stack automata and complexity classes, Literal shuffle on \(\omega\)-languages, On the index of positive programmed formal languages, Regulated RNA rewriting: Modelling RNA editing with guided insertion, Language-theoretic problems arising from Richelieu cryptosystems, Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity, Storage products and linear control of derivations, Pseudo-inversion: closure properties and decidability, Template-guided DNA recombination, \(X\)-automata on \(\omega\)-words, On incomparable abstract family of languages (AFL), Abstract families of length-preserving processors, Context-free grammar forms, On the properties of language classes defined by bounded reaction automata, Basic tree transducers, Look-ahead on pushdowns, Regularity of sets of initial strings of periodic D0L-systems, On the Hurwitz product of formal power series and automata, A prime decomposition theorem for grammatical families, Weighted automata with storage, On store languages of language acceptors, The structure of context-free grammatical families, Produit dans le cône rationnel engendre par D, A note on cyclic closure operations, One-way simple multihead finite automata, On simple generators of recursively enumerable languages, On the family of finite index matrix languages, Principal abstract families of weighted tree languages, Groups whose word problems are not semilinear, On input-revolving deterministic and nondeterministic finite automata, A homomorphic characterization of principal semi AFLs without using intersection with regular sets, On some bounded semiAFLs and AFLs, Checking sets, test sets, rich languages and commutatively closed languages, On families of full trios containing counter machine languages, On the equality of grammatical families, Characterizations and computational complexity of systolic trellis automata, On certain closure operators defined by families of semiring morphisms, Fuzzy context-free languages. I: Generalized fuzzy context-free grammars, Fuzzy context-free languages. II: Recognition and parsing algorithms, Linear indexed languages, Hierarchies of hyper-AFLs, An inverse homomorphic characterization of full principal AFL, Partial commutations and faithful rational transductions, Extending regular expressions with iterated shuffle, Extended macro grammars and stack controlled machines, Closure properties of slender languages, Computation theoretic aspects of cellular automata, Formal languages and global cellular automaton behavior, Alternating multicounter machines with constant number of reversals, Transitive sofic spacing shifts, On two families of forests, Algebraic aspects of families of fuzzy languages
