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)

Weighted automata and weighted logics on infinite words
Weighted tree automata and weighted logics
scientific article; zbMATH DE number 3858419 (Why is no real title available?)
On a family of L languages resulting from systolic tree automata
Formulae and asymptotics for coefficients of algebraic functions
Algebraic systems and pushdown automata
Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
The freeness problem over matrix semigroups and bounded languages
A factorization theory for some free fields
Analogies and differences between quantum and stochastic automata
On positive matrices
A note on the equivalence problem of rational formal power series
On equality of multiplicity sets of regular languages
Linearizing the word problem in (some) free fields
Enumeration d'arbres et formules d'inversion de séries formelles
Self-avoiding walks and multiple context-free languages
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
The operation on formal power series
scientific article; zbMATH DE number 7104930 (Why is no real title available?)
The zig-zag power series: A two-way version of the \({}^*\) operator.
Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series
On Lindenmayerian algebraic sequences
Some decisional problems on rational relations
Separators in infinite words generated by morphisms.
Number of prefixes in trace monoids: clique polynomials and dependency graphs
Asymptotic approximation by regular languages
The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
Prefixes of infinite words and ambiguous context-free languages
A non-ambiguous decomposition of regular languages and factorizing codes
Weighted automata with discounting
Unbounded-error quantum computation with small space bounds
Decorated one-dimensional cobordisms and tensor envelopes of noncommutative recognizable power series
Regular languages and their generating functions: The inverse problem
Watson-Crick (D)0L systems: a survey
Finitely generated subgroups of free groups as formal languages and their cogrowth
The cyclicity problem for the images of \(q\)-rational series
Watson-Crick D0L systems: The power of one transition
Decidability results for Watson-Crick D0L systems with nonregular triggers.
A technology for reverse-engineering a combinatorial problem from a rational generating function
Rational languages and the Burnside problem
Weighted automata and weighted MSO logics for average and long-time behaviors
A Kleene-Schützenberger theorem for weighted timed automata
Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials
Regular language distance and entropy
Asymptotic properties of free monoid morphisms
On morphically generated formal power series
On binary equality sets and a solution to the test set conjecture in the binary case
Skew and infinitary formal power series
Colored operads, series on colored operads, and combinatorial generating systems
scientific article; zbMATH DE number 7453188 (Why is no real title available?)
On a generalization of the Dyck-language over a two letter alphabet
On the interpolation of DOL-sequences
Weights of formal languages based on geometric series with an application to automatic grading
Characterizing regular languages with polynomial densities
The algebraic equivalent of AFL theory
A Kleene-Schützenberger Theorem for Weighted Timed Automata
Positive tree representations and applications to tree automata
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
Analytic models and ambiguity of context-free languages
\(\mathbb Z\)-rationality of a certain class of formal series
Definable transductions and weighted logics for texts
An optimal pre-determinization algorithm for weighted transducers
Branching automata with costs -- a way of reflecting parallelism in costs
Weak minimization of DFA -- an algorithm and applications
Carathéodory extensions of subclasses of regular languages
Weighted finite transducers in image processing
scientific article; zbMATH DE number 7559164 (Why is no real title available?)
scientific article; zbMATH DE number 7204387 (Why is no real title available?)
Absolute convergence of rational series is semi-decidable
Rationality of the Möbius function of subword order
Crisp-determinization of weighted tree automata over strong bimonoids
Weighted automata and weighted logics with discounting
A unified framework for disambiguating finite transductions
The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
Programmable finite automata for VLSI†
On Lindenmayerian algebraic power series
Direct and dual laws for automata with multiplicities
Marked D0L systems and the 2n-conjecture
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
The number of convex permutominoes
scientific article; zbMATH DE number 3709587 (Why is no real title available?)
scientific article; zbMATH DE number 3876606 (Why is no real title available?)
Weighted automata and weighted logics
On infinite HD0L words having sparse letters
The growth function of \(S\)-recognizable sets
Networks of evolutionary processors: the power of subregular filters
On the spectral and combinatorial structure of 2D positive systems
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
On differentiation functions, structure functions, and related languages of context-free grammars
Weighted automata and weighted logics
3-Way Composition of Weighted Finite-State Transducers
A unifying Kleene theorem for weighted finite automata
The ring of k-regular sequences
Definitions and properties of entropy and distance for regular languages
OpenFst: A General and Efficient Weighted Finite-State Transducer Library
Derivatives of rational expressions and related theorems.
The design principles of a weighted finite-state transducer library
scientific article; zbMATH DE number 7561720 (Why is no real title available?)

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)