scientific article; zbMATH DE number 3509706
From MaRDI portal
Publication:4089754
Cited in
(only showing first 100 items - show all)- Transitive sofic spacing shifts
- Literal shuffle
- Compelled operations and operations of degreeP
- A remark about a substitution property
- On the Hurwitz product of formal power series and automata
- Checking sets, test sets, rich languages and commutatively closed languages
- Morphic congruences and D0L languages
- Partial commutations and faithful rational transductions
- 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
- Characterizations and computational complexity of systolic trellis automata
- Closure properties of slender languages
- The algebraic equivalent of AFL theory
- Extending regular expressions with iterated shuffle
- Pseudo-inversion: closure properties and decidability
- Complete symmetry in d2l systems and cellular automata
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- Closure property of principal cones under substitution
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- Transductions and the parallel generation of languages†
- Deterministic Input-Reversal and Input-Revolving Finite Automata
- On the properties of language classes defined by bounded reaction automata
- Quotient and bounded context-free languages
- Abstract grammars based on transductions
- On bounded semilinear languages, counter machines, and finite-index ET0L
- Languages, Decidability, and Complexity
- The power of synchronizing operations on strings
- Prefix and equality languages of rational functions are co-context-free
- On characterisation of language families in terms of inverse morphisms
- Cônes rationnels commutatifs
- scientific article; zbMATH DE number 3551930 (Why is no real title available?)
- 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.
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Remarks on regulated limited ET0L systems and regulated context-free grammars
- scientific article; zbMATH DE number 3982518 (Why is no real title available?)
- scientific article; zbMATH DE number 4005620 (Why is no real title available?)
- Linear indexed languages
- Families of languages defined by ciliate bio-operations
- Branching synchronization grammars with nested tables
- Sur la structure des langages algébriques
- Recursivite et cônes rationnels fermés par intersection
- Produit dans le cône rationnel engendre par D
- Codeterministic Lindenmayer schemes and systems
- \(X\)-automata on \(\omega\)-words
- Rational bijection of rational sets
- Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
- Extended macro grammars and stack controlled machines
- On-line n-bounded multicounter automata
- Persistent ETOL systems
- A propos du lemme de substitution
- Substitution of semi-AFL's
- On Computational Properties of Template-Guided DNA Recombination
- Infinite unfair shuffles and associativity
- Storage products and linear control of derivations
- On incomparable abstract family of languages (AFL)
- On the usefulness of bifaithful rational cones
- Context-free grammar forms
- The structure of context-free grammatical families
- Iterated stack automata and complexity classes
- Algebraic aspects of families of fuzzy languages
- On simple generators of recursively enumerable languages
- scientific article; zbMATH DE number 3677223 (Why is no real title available?)
- On families of full trios containing counter machine 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
- Abstract families of context-free grammars
- scientific article; zbMATH DE number 3808971 (Why is no real title available?)
- scientific article; zbMATH DE number 3872715 (Why is no real title available?)
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- On language equations with invertible operations
- scientific article; zbMATH DE number 3669877 (Why is no real title available?)
- Context-sensitive string languages and recognizable picture languages
- Continuous operations on languages
- The emptiness problem for valence automata over graph monoids
- A result concerning the trios generated by commutative SLIP-languages
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- On store languages of language acceptors
- On the family of finite index matrix languages
- On counting functions and slenderness of languages
- On two families of forests
- Some hierarchies for the communication complexity measures of cooperating grammar systems
- On some transducer equivalence problems for families of languages
- Fuzzy context-free languages. II: Recognition and parsing algorithms
- scientific article; zbMATH DE number 3797185 (Why is no real title available?)
- On Families of Full Trios Containing Counter Machine Languages
- Budget-bounded model-checking pushdown systems
- Langages satures et cônes decroissants. Langages et cônes bifideles
- Groups whose word problems are not semilinear
- Schema for parallel insertion and deletion: revisited
- Subword topology
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)