scientific article; zbMATH DE number 3588051
From MaRDI portal
Publication:4155837
zbMATH Open0377.68039MaRDI QIDQ4155837FDOQ4155837
Authors: Matti Soittola, Arto Salomaa
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)
- A note on the equivalence problem of rational formal power series
- On equality of multiplicity sets of regular languages
- 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
- 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 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
- On a family of L languages resulting from systolic tree automata
- The operation \(\uparrow\) on formal power series
- The zig-zag power series: A two-way version of the \({}^*\) operator.
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- Prefixes of infinite words and ambiguous context-free languages
- Characterizing regular languages with polynomial densities
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- On binary equality sets and a solution to the test set conjecture in the binary case
- 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
- Rationality of the Möbius function of subword order
- Absolute convergence of rational series is semi-decidable
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- Weighted automata and weighted logics with discounting
- Holonomic functions and their relation to linearly constrained languages
- On the equivalence problem for succession rules
- The algebraic theory of Parikh automata
- On Sequences Defined by D0L Power Series
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
- A representation theorem of infinite dimensional algebras and applications to language theory
- Recognizable formal power series on trees
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- On some decision questions concerning pushdown machines
- Iterative and recursive matrix theories
- On commutative DTOL systems
- Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
- Weighted picture automata and weighted logics
- Some decidability results about regular and pushdown translations
- Remarks on commutative N-rational series
- Context-free series on trees
- Monomial reachability and zero controllability of discrete-time positive switched systems
- Effective entropies and data compression
- On algebraic generalized zeta functions of formal power series
- Hopf algebra structure of generalized quasi-symmetric functions in partially commutative variables
- Positivity of second order linear recurrent sequences
- \(k\)-abelian equivalence and rationality
- Varieties of recognizable tree series over fields
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- A characterization of rational D0L power series
- A necessary condition for the rationality of the zeta function of a regular language
- On generalized zeta functions of formal languages and series
- The rank of a formal tree power series
- On aperiodic and star-free formal power series in partially commuting variables
- Positivity of third order linear recurrence sequences
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)