scientific article; zbMATH DE number 3588051
From MaRDI portal
Publication:4155837
Automata and formal grammars in connection with logical questions (03D05) Integral domains (associative rings and algebras) (16U10) Power series (including lacunary series) in one complex variable (30B10) 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)- Semi-synchronous transductions
- A note on commutative multivariate rational series
- Weighted asynchronous cellular automata
- Characterizations of recognizable picture series
- On binary equality sets and a solution to the test set conjecture in the binary case
- Cyclic derivation of noncommutative algebraic power series
- Polynomials associated with the characters of SU(n)
- On cancellation properties of languages which are supports of rational power series
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- R-fuzzy computation
- Computation theory of cellular automata
- Perron-Frobenius theory of some algebraic equations associated with context free grammars
- Occurrence of zero in a linear recursive sequence
- Rational languages and the Burnside problem
- Truncations of infinite matrices and algebraic series associated with some CF grammars
- Recurrent words and simultaneous growth in T0L systems
- A note on the equivalence problem of rational formal power series
- On equality of multiplicity sets of regular languages
- Analytic models and ambiguity of context-free languages
- Prefixes of infinite words and ambiguous context-free languages
- A unified framework for disambiguating finite transductions
- A necessary condition for the rationality of the zeta function of a regular language
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series
- On a generalization of the Dyck-language over a two letter alphabet
- The characterization of parallel ultralinear grammars by rational power series
- Rational bijection of rational sets
- On generators and generative capacity of EOL forms
- Operatorenkalkül über freien Monoiden I: Strukturen
- Sur les séries associees à certains systèmes de Lindenmayer
- On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
- Enumeration d'arbres et formules d'inversion de séries formelles
- An L-system approach to nonnegative matrices for the spectral analysis of discrete growth functions of populations
- Sub-regular grammar forms
- On nonstochastic languages and homomorphic images of stochastic languages
- Properties of structure generating functions of automata and their applications for linear systems
- Recognizable formal power series on trees
- Automatic average-case analysis of algorithms
- The complexity of computing the number of strings of given length in context-free languages
- On generalized zeta functions of formal languages and series
- Probabilistic estimation of the number of prefixes of a trace
- Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
- On a kind of Fatou property of context-free groups
- Rationality of the Möbius function of subword order
- Dynamic algebras: Examples, constructions, applications
- Nivat's theorem for pushdown transducers
- The ring of k-regular sequences
- On the decidability of the equivalence problem for partially commutative rational power series
- Multiplicities: A deterministic view of nondeterminism
- On transductions of formal power series over complete semirings
- Rational series with coefficients in a commutative ring
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Remarks on commutative N-rational series
- Some decidability results about regular and pushdown translations
- On the interpolation of DOL-sequences
- On rational series and rational languages
- Examples of undecidable problems for 2-generator matrix semigroups
- The complexity of the max word problem and the power of one-way interactive proof systems
- On D0L systems with immigration
- On two families of forests
- Some consequences of a Fatou property of the tropical semiring
- On language equations with invertible operations
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
- On developmental systems: Multilevel and parallel development
- Algebraic languages and polyominoes enumeration
- Stochastically costed tree automata: Turakainen's theorem
- Positive tree representations and applications to tree automata
- Some decisional problems on rational relations
- Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series
- Separators in infinite words generated by morphisms.
- On Lindenmayerian algebraic power series
- On Lindenmayerian algebraic sequences
- The equational logic of fixed points
- Watson-Crick D0L systems: The power of one transition
- On images of D0L and DT0L power series.
- One application of real-valued interpretation of formal power series.
- Decidability results for Watson-Crick D0L systems with nonregular triggers.
- On transformations of formal power series.
- Derivatives of rational expressions and related theorems.
- Splicing in abstract families of languages
- On D0L power series
- The design principles of a weighted finite-state transducer library
- Forbidden words in symbolic dynamics
- An algebraic characterization of the set of succession rules
- Uni-transitional Watson-Crick D0L systems
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring
- Discrete Watson-Crick dynamical systems
- A generalized Goulden-Jackson cluster method and lattice path enumeration
- Generalization bounds for learning weighted automata
- The language equivalence problem for HD0L systems having D0L growths
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
- Weighted restarting automata
- Weighted finite transducers in image processing
- On some bounded semiAFLs and AFLs
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Context-free series on trees
- The monadic theory of morphic infinite words and generalizations
- A non-ambiguous decomposition of regular languages and factorizing codes
- On the spectral and combinatorial structure of 2D positive systems
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 Q4155837)