scientific article; zbMATH DE number 3509706

Cited in

(only showing first 100 items - show all)

On input-revolving deterministic and nondeterministic finite automata
Hierarchies of hyper-AFLs
An inverse homomorphic characterization of full principal AFL
Extending regular expressions with iterated shuffle
Extended macro grammars and stack controlled machines
Alternating multicounter machines with constant number of reversals
On coordinated selective substitutions: Towards a unified theory of grammars and machines
CTS systems and Petri nets
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
Closure property of principal cones under substitution
A representation of recursively enumerable languages by two homomorphisms and a quotient
On the intersection of stacks and queues
Prefix and equality languages of rational functions are co-context-free
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-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
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
A result concerning the trios generated by commutative SLIP-languages
Abstract grammars based on transductions
QRT FIFO automata, breadth-first grammars and their relations
Iterated stack automata and complexity classes
\(X\)-automata on \(\omega\)-words
On incomparable abstract family of languages (AFL)
Abstract families of length-preserving processors
Context-free grammar forms
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 the family of finite index matrix languages
On certain closure operators defined by families of semiring morphisms
Closure properties of slender languages
On two families of forests
Some hierarchies for the communication complexity measures of cooperating grammar systems
On language equations with invertible operations
Morphic congruences and D0L languages
Context-sensitive string languages and recognizable picture languages
Closure and decidability properties of some language classes with respect to ciliate bio-operations.
Refining the hierarchy of blind multicounter languages and twist-closed trios.
Template-guided DNA recombination
On store languages of language acceptors
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
Algebraic aspects of families of fuzzy languages
On the splicing operation
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Pseudo-inversion: closure properties and decidability
Principal abstract families of weighted tree languages
On the Hurwitz product of formal power series and automata
Weighted automata with storage
Groups whose word problems are not semilinear
On families of full trios containing counter machine languages
The chop of languages
Infinite unfair shuffles and associativity
On counting functions and slenderness of languages
Regulated RNA rewriting: Modelling RNA editing with guided insertion
Storage products and linear control of derivations
Transitive sofic spacing shifts
Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
Fuzzy context-free languages. II: Recognition and parsing algorithms
Well-structured languages
The emptiness problem for valence automata over graph monoids
On Families of Full Trios Containing Counter Machine Languages
On bounded semilinear languages, counter machines, and finite-index ET0L
Schema for parallel insertion and deletion: revisited
scientific article; zbMATH DE number 3872715 (Why is no real title available?)
On characterisation of language families in terms of inverse morphisms
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
Conversion of regular expressions into realtime automata
HYBRID EXTENDED FINITE AUTOMATA
Deterministic Input-Reversal and Input-Revolving Finite Automata
On Computational Properties of Template-Guided DNA Recombination
scientific article; zbMATH DE number 3808971 (Why is no real title available?)
On the usefulness of bifaithful rational cones
scientific article; zbMATH DE number 3982518 (Why is no real title available?)
scientific article; zbMATH DE number 4005620 (Why is no real title available?)
Uniform simulations of nondeterministic real time multitape turing machines
Iterated linear control and iterated one-turn pushdowns
A new normal form for the compositions of morphisms and inverse morphisms
Complete symmetry in d2l systems and cellular automata
Quotient and bounded context-free languages
On some transducer equivalence problems for families of languages

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)