scientific article; zbMATH DE number 3588051

zbMATH Open0377.68039MaRDI QIDQ4155837FDOQ4155837

Publication date: 1978

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) Automata and formal grammars in connection with logical questions (03D05) Power series (including lacunary series) in one complex variable (30B10) Integral domains (associative rings and algebras) (16U10)

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

Enumeration d'arbres et formules d'inversion de séries formelles
Asymptotic approximation by regular languages
A technology for reverse-engineering a combinatorial problem from a rational generating function
Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials
Skew and infinitary formal power series
On a generalization of the Dyck-language over a two letter alphabet
\(\mathbb Z\)-rationality of a certain class of formal series
Definable transductions and weighted logics for texts
Carathéodory extensions of subclasses of regular languages
Programmable finite automata for VLSI†
On the spectral and combinatorial structure of 2D positive systems
The design principles of a weighted finite-state transducer library
On transformations of formal power series.
Sublogarithmic ambiguity
Semi-synchronous transductions
Rational bijection of rational sets
Multiplicities: A deterministic view of nondeterminism
A note on commutative multivariate rational series
Homomorphism equivalence on etol languages†
Weighted asynchronous cellular automata
On recognizable and rational formal power series in partially commuting variables
Another proof of Soittola's theorem
Splicing in abstract families of languages
On some transducer equivalence problems for families of languages
The Cohn localization of the free group ring
Title not available (Why is that?)
Title not available (Why is that?)
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
Counting problems and algebraic formal power series in noncommuting variables
A model for developmental systems. I: Generating word without any operating system
New techniques for proving the decidability of equivalence problem
Parallel complexity of the regular code problem
Title not available (Why is that?)
A formal power series approach to the construction of minimal fuzzy automata
Series which are both max-plus and min-plus rational are unambiguous
A note on terminal balancing of algebraic systems
Cyclic derivation of noncommutative algebraic power series
Polynomials associated with the characters of SU(n)
Perron-Frobenius theory of some algebraic equations associated with context free grammars
Truncations of infinite matrices and algebraic series associated with some CF grammars
An L-system approach to nonnegative matrices for the spectral analysis of discrete growth functions of populations
Properties of structure generating functions of automata and their applications for linear systems
A unifying approach to algebraic systems over semirings
On formal power series defined by infinite linear systems
On cancellation properties of languages which are supports of rational power series
Sub-regular grammar forms
Some remarks on recognizable treeseries
Characterizations of recognizable picture series
R-fuzzy computation
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Characterization of circular D0L-systems
On generators and generative capacity of EOL forms
Recurrent words and simultaneous growth in T0L systems
Linearizing the word problem in (some) free fields
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
A non-ambiguous decomposition of regular languages and factorizing codes
Colored operads, series on colored operads, and combinatorial generating systems
Title not available (Why is that?)
Title not available (Why is that?)
Crisp-determinization of weighted tree automata over strong bimonoids
Title not available (Why is that?)
Networks of evolutionary processors: the power of subregular filters
Algorithms for approximate subtropical matrix factorization
More on quantum, stochastic, and pseudo stochastic languages with few states
Recurrence relations, succession rules and the positivity problem
First-order logic and numeration systems
On computational power of weighted finite automata
Enumerative sequences of leaves in rational trees
Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring
The language equivalence problem for HD0L systems having D0L growths
It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
Learning weighted automata
The Coxeter relations and KP map for non-commuting symbols
Finite sequentiality of unambiguous max-plus tree automata
A standard form in (some) free fields: how to construct minimal linear representations
Weighted restarting automata
On the factorization of non-commutative polynomials (in free associative algebras)
Ambiguity Hierarchies for Weighted Tree Automata
Recognizability of the support of recognizable series over the semiring of the integers is undecidable
Weighted automata with storage
Discrete Watson-Crick dynamical systems
The equivalence of deterministic gsm replications onQ-rational languages is decidable
Approximate minimization of weighted tree automata
Principal abstract families of weighted tree languages
Weighted operator precedence languages
Regular sequences and synchronized sequences in abstract numeration systems
Weighted automata
A generalized Goulden-Jackson cluster method and lattice path enumeration
Automata and rational expressions
Equational theories for automata
Enumerative sequences of leaves and nodes in rational trees
Quantitative vs. weighted automata
ON APPLICATION OF MULTIDIMENSIONAL COMPLEX ANALYSIS IN FORMAL LANGUAGE AND GRAMMAR THEORY
Absolute Convergence of Rational Series Is Semi-decidable
On finite and polynomial ambiguity of weighted tree automata
Generalization bounds for learning weighted automata
Quasi-universal \(k\)-regular sequences
An algebraic characterization of semirings for which the support of every recognizable series is recognizable

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)