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)
- 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
- Effective construction of the syntactic algebra of a recognizable series on trees
- Measuring power of locally testable languages
- Title not available (Why is that?)
- Algebraic aspects of B-regular series
- Valuations and unambiguity of languages, with applications to fractal geometry
- Weighted Automata and Weighted Logics with Discounting
- On some bounded semiAFLs and AFLs
- On images of D0L and DT0L power series.
- On D0L power series
- One application of real-valued interpretation of formal power series.
- Separately continuous algebras
- On formal power series defined by infinite linear systems
- On the supports of recognizable timed series
- Representation theory of finite semigroups over semirings.
- On nonstochastic languages and homomorphic images of stochastic languages
- A noncommutative enumeration problem
- Completing biprefix codes
- Enhanced coalgebraic bisimulation
- Automatic average-case analysis of algorithms
- Representations and complete semiring morphisms
- Valuations of languages, with applications to fractal geometry
- Formulae and asymptotics for coefficients of algebraic functions
- On positive matrices
- Weighted tree automata and weighted logics
- The freeness problem over matrix semigroups and bounded languages
- Regular languages and their generating functions: The inverse problem
- Weighted automata with discounting
- Unbounded-error quantum computation with small space bounds
- Weighted automata and weighted MSO logics for average and long-time behaviors
- On morphically generated formal power series
- Rational languages and the Burnside problem
- A Kleene-Schützenberger theorem for weighted timed automata
- Asymptotic properties of free monoid morphisms
- 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
- Weighted finite transducers in image processing
- Direct and dual laws for automata with multiplicities
- On Lindenmayerian algebraic power series
- Weighted automata and weighted logics
- Weighted automata and weighted logics
- The number of convex permutominoes
- Marked D0L systems and the \(2n\)-conjecture
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- The growth function of \(S\)-recognizable sets
- A unifying Kleene theorem for weighted finite automata
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library
- The ring of \(k\)-regular sequences
- Exactly solved models
- Integral Representation and Algorithms for Closed Form Summation
- Algebraic languages and polyominoes enumeration
- Uni-transitional Watson-Crick D0L systems
- The equational logic of fixed points
- Title not available (Why is that?)
- Clique polynomials have a unique root of smallest modulus
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)