scientific article; zbMATH DE number 3588051

Publication date 1978

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)

Rational bijection of rational sets
Sublogarithmic ambiguity
Semi-synchronous transductions
Cyclic derivation of noncommutative algebraic power series
Recurrent words and simultaneous growth in T0L systems
Carathéodory extensions of subclasses of regular languages
Polynomials associated with the characters of SU(n)
Enumeration d'arbres et formules d'inversion de séries formelles
A note on terminal balancing of algebraic systems
On cancellation properties of languages which are supports of rational power series
Skew and infinitary formal power series
A formal power series approach to the construction of minimal fuzzy automata
R-fuzzy computation
Asymptotic approximation by regular languages
Perron-Frobenius theory of some algebraic equations associated with context free grammars
Truncations of infinite matrices and algebraic series associated with some CF grammars
On recognizable and rational formal power series in partially commuting variables
On a generalization of the Dyck-language over a two letter alphabet
A technology for reverse-engineering a combinatorial problem from a rational generating function
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
Another proof of Soittola's theorem
Characterizations of recognizable picture series
Programmable finite automata for VLSI†
A unifying approach to algebraic systems over semirings
On transformations of formal power series.
\(\mathbb Z\)-rationality of a certain class of formal series
On the spectral and combinatorial structure of 2D positive systems
The design principles of a weighted finite-state transducer library
Homomorphism equivalence on etol languages†
Weighted asynchronous cellular automata
Series which are both max-plus and min-plus rational are unambiguous
Splicing in abstract families of languages
Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials
scientific article; zbMATH DE number 7438576 (Why is no real title available?)
scientific article; zbMATH DE number 7439745 (Why is no real title available?)
scientific article; zbMATH DE number 7561611 (Why is no real title available?)
Definable transductions and weighted logics for texts
Multiplicities: A deterministic view of nondeterminism
An L-system approach to nonnegative matrices for the spectral analysis of discrete growth functions of populations
scientific article; zbMATH DE number 3808989 (Why is no real title available?)
scientific article; zbMATH DE number 3776897 (Why is no real title available?)
A note on commutative multivariate rational series
Sub-regular grammar forms
Properties of structure generating functions of automata and their applications for linear systems
The Cohn localization of the free group ring
A note on the equivalence problem of rational formal power series
On equality of multiplicity sets of regular languages
On some transducer equivalence problems for families of languages
Characterization of circular D0L-systems
Some remarks on recognizable treeseries
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
On generators and generative capacity of EOL forms
Entropy of generating series for nonlinear input-output systems and their interconnections
Disambiguation of weighted tree automata
Finite ambiguity and finite sequentiality in weighted automata over fields
Learning weighted automata
It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
On the Rademacher complexity of weighted automata
ON APPLICATION OF MULTIDIMENSIONAL COMPLEX ANALYSIS IN FORMAL LANGUAGE AND GRAMMAR THEORY
A non-ambiguous decomposition of regular languages and factorizing codes
Polynomially ambiguous probabilistic automata on restricted languages
Enumerative sequences of leaves in rational trees
Weighted automata with storage
Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
Algorithms for approximate subtropical matrix factorization
A generalized Goulden-Jackson cluster method and lattice path enumeration
A standard form in (some) free fields: how to construct minimal linear representations
scientific article; zbMATH DE number 7559164 (Why is no real title available?)
scientific article; zbMATH DE number 7204387 (Why is no real title available?)
Linearizing the word problem in (some) free fields
Networks of evolutionary processors: the power of subregular filters
Absolute Convergence of Rational Series Is Semi-decidable
More on quantum, stochastic, and pseudo stochastic languages with few states
The language equivalence problem for HD0L systems having D0L growths
Recurrence relations, succession rules and the positivity problem
The equivalence of deterministic gsm replications onQ-rational languages is decidable
Discrete Watson-Crick dynamical systems
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable
First-order logic and numeration systems
Ambiguity Hierarchies for Weighted Tree Automata
On computational power of weighted finite automata
scientific article; zbMATH DE number 3709587 (Why is no real title available?)
Automata methods in transcendence
Automata and rational expressions
Equational theories for automata
Weighted restarting automata
Quasi-universal \(k\)-regular sequences
Number of prefixes in trace monoids: clique polynomials and dependency graphs
Recognizability of the support of recognizable series over the semiring of the integers is undecidable
Enumerative sequences of leaves and nodes in rational trees
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
Crisp-determinization of weighted tree automata over strong bimonoids
The Coxeter relations and KP map for non-commuting symbols
On finite and polynomial ambiguity of weighted tree automata

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)