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)
- 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
- Weighted finite automata over strong bimonoids
- A coalgebraic perspective on linear weighted automata
- Weighted logics for unranked tree automata
- Fuzzy relation equations and reduction of fuzzy automata
- Determinization of weighted finite automata over strong bimonoids
- The monadic theory of morphic infinite words and generalizations
- A survey of computational complexity results in systems and control
- The equivalence problem of multitape finite automata
- Sur les séries associees à certains systèmes de Lindenmayer
- Dynamic algebras: Examples, constructions, applications
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- Intuitionistic fuzzy left \(k\)-ideals of semirings.
- On rational series and rational languages
- Combinatorial aspects of \(L\)-convex polyominoes
- On language equations with invertible operations
- Methods and applications of \((\max,+)\) linear algebra
- Examples of undecidable problems for 2-generator matrix semigroups
- Products of matrices and recursively enumerable sets
- A Kraft-McMillan inequality for free semigroups of upper-triangular matrices
- Spectral learning of weighted automata. A forward-backward perspective
- Forbidden words in symbolic dynamics
- The isomorphism problem on classes of automatic structures with transitive relations
- Bilinear system interconnections and generating series of weighted Petri nets
- Coping with selfish on-going behaviors
- Eulerian cube complexes and reciprocity
- Quasi-polynomials, linear Diophantine equations and semi-linear sets
- On continuous functions computed by finite automata
- Finite generating sets of relatively hyperbolic groups and applications to geodesic languages
- Occurrence of zero in a linear recursive sequence
- On quotients of formal power series
- Production matrices and riordan arrays
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- An algebraic characterization of the set of succession rules
- Computation theory of cellular automata
- On infinite words generated by polynomial D0L systems
- Probabilistic models for pattern statistics
- Definability of combinatorial functions and their linear recurrence relations
- Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
- Recurrence relations, succession rules, and the positivity problem
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- On problems related to growth, entropy, and spectrum in group theory
- Asymptotic stability and stabilizability of special classes of discrete-time positive switched systems
- Cayley graphs and automatic sequences
- A lower bound for probabilistic algorithms for finite state machines
- Equational axioms for regular sets
- D0L sequence equivalence is inPfor fixed alphabets
- On Solvability of Systems of Symbolic Polynomial Equations
- The complexity of the max word problem and the power of one-way interactive proof systems
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- The complexity of computing the number of strings of given length in context-free languages
- Rationality and reciprocity for the greedy normal form of a Coxeter group.
- A representation theorem for (\(q\)-)holonomic sequences
- Weighted finite automata over hemirings
- Analogies and differences between quantum and stochastic automata
- Weighted automata and weighted logics on infinite words
- 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
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)