scientific article; zbMATH DE number 3509706

zbMATH Open0325.68002MaRDI QIDQ4089754FDOQ4089754

Publication date: 1975

Title of this publication is not available (Why is that?)

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)

Cited In (only showing first 100 items - show all)

Literal shuffle
Transitive sofic spacing shifts
Checking sets, test sets, rich languages and commutatively closed languages
Morphic congruences and D0L languages
Partial commutations and faithful rational transductions
Characterizations and computational complexity of systolic trellis automata
Closure properties of slender languages
Extending regular expressions with iterated shuffle
Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
Deterministic Input-Reversal and Input-Revolving Finite Automata
Languages, Decidability, and Complexity
On the properties of language classes defined by bounded reaction automata
Abstract grammars based on transductions
On characterisation of language families in terms of inverse morphisms
The power of synchronizing operations on strings
Title not available (Why is that?)
Cônes rationnels commutatifs
Basic tree transducers
Look-ahead on pushdowns
Regularity of sets of initial strings of periodic D0L-systems
A prime decomposition theorem for grammatical families
Refining the hierarchy of blind multicounter languages and twist-closed trios.
Linear indexed languages
Families of languages defined by ciliate bio-operations
Branching synchronization grammars with nested tables
\(X\)-automata on \(\omega\)-words
Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
Rational bijection of rational sets
On Computational Properties of Template-Guided DNA Recombination
Extended macro grammars and stack controlled machines
On the usefulness of bifaithful rational cones
On incomparable abstract family of languages (AFL)
Context-free grammar forms
The structure of context-free grammatical families
Title not available (Why is that?)
Algebraic aspects of families of fuzzy languages
Iterated stack automata and complexity classes
On simple generators of recursively enumerable languages
A-transducers and the monotonicity of IL schemes
On the intersection of stacks and queues
Multiple equality sets and Post machines
QRT FIFO automata, breadth-first grammars and their relations
Title not available (Why is that?)
Regulated RNA rewriting: Modelling RNA editing with guided insertion
On language equations with invertible operations
Deletion operations on deterministic families of automata
Context-sensitive string languages and recognizable picture languages
Closure and decidability properties of some language classes with respect to ciliate bio-operations.
On some transducer equivalence problems for families of languages
Fuzzy context-free languages. II: Recognition and parsing algorithms
Budget-bounded model-checking pushdown systems
Schema for parallel insertion and deletion: revisited
Template-guided DNA recombination
Subword topology
The chop of languages
One-way simple multihead finite automata
On input-revolving deterministic and nondeterministic finite automata
On some bounded semiAFLs and AFLs
On commutative context-free languages
Three hierarchies of transducers
An inverse homomorphic characterization of full principal AFL
Hierarchies of hyper-AFLs
Computation theoretic aspects of cellular automata
Normal forms for phrase-structure grammars
On the equality of grammatical families
Well-structured languages
Title not available (Why is that?)
Formal languages and global cellular automaton behavior
Position-restricted grammar forms and grammars
On nonstochastic languages and homomorphic images of stochastic languages
Literal shuffle on \(\omega\)-languages
Title not available (Why is that?)
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
A homomorphic characterization of principal semi AFLs without using intersection with regular sets
Alternating multicounter machines with constant number of reversals
On generators and generative capacity of EOL forms
On the index of positive programmed formal languages
On the splicing operation
Language-theoretic problems arising from Richelieu cryptosystems
Compelled operations and operations of degreeP
A remark about a substitution property
On the Hurwitz product of formal power series and automata
Variations of checking stack automata: obtaining unexpected decidability properties
On certain closure operators defined by families of semiring morphisms
A note on cyclic closure operations
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
Representations of language families by homomorphic equality operations and generalized equality sets
The algebraic equivalent of AFL theory
Complete symmetry in d2l systems and cellular automata
Pseudo-inversion: closure properties and decidability
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
Transductions and the parallel generation of languages^†
Closure property of principal cones under substitution
A representation of recursively enumerable languages by two homomorphisms and a quotient
Quotient and bounded context-free languages
Prefix and equality languages of rational functions are co-context-free
Title not available (Why is that?)
Title not available (Why is that?)
Remarks on regulated limited ET0L systems and regulated context-free grammars

This page was built for publication:

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