scientific article; zbMATH DE number 3588051
From MaRDI portal
Publication:4155837
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)- Iterative devices generating infinite words
- Algebraic languages and polyominoes enumeration
- Exactly solved models
- Uni-transitional Watson-Crick D0L systems
- On transformations of formal power series.
- More on quantum, stochastic, and pseudo stochastic languages with few states
- Algorithms for approximate subtropical matrix factorization
- The equational logic of fixed points
- Integral Representation and Algorithms for Closed Form Summation
- The algebraic theory of Parikh automata
- Holonomic functions and their relation to linearly constrained languages
- On the equivalence problem for succession rules
- Recurrence relations, succession rules and the positivity problem
- Clique polynomials have a unique root of smallest modulus
- Local limit laws for symbol statistics in bicomponent rational models
- A representation theorem of infinite dimensional algebras and applications to language theory
- A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
- Weighted finite automata over strong bimonoids
- First-order logic and numeration systems
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Sublogarithmic ambiguity
- Characterizing weighted MSO for trees by branching transitive closure logics
- On computational power of weighted finite automata
- Recognizable formal power series on trees
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Finitely ambiguous and finitely sequential weighted automata over fields
- On Sequences Defined by D0L Power Series
- Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability.
- A coalgebraic perspective on linear weighted automata
- Enumerative sequences of leaves in rational trees
- Maclaurin series for \(\sin_p\) with \(p\) an integer greater than 2
- Fuzzy relation equations and reduction of fuzzy automata
- Determinization of weighted finite automata over strong bimonoids
- Dead ends and rationality of complete growth series
- On some decision questions concerning pushdown machines
- Weighted logics for unranked tree automata
- Iterative and recursive matrix theories
- On commutative DTOL systems
- Semi-synchronous transductions
- Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring
- Equations and regular-like expressions for afa
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series
- The characterization of parallel ultralinear grammars by rational power series
- The language equivalence problem for HD0L systems having D0L growths
- The monadic theory of morphic infinite words and generalizations
- Rational bijection of rational sets
- Finite transducers and rational transductions
- Census algorithms for chinese remainder pseudorank
- A survey of computational complexity results in systems and control
- scientific article; zbMATH DE number 7300346 (Why is no real title available?)
- The equivalence problem of multitape finite automata
- scientific article; zbMATH DE number 7746261 (Why is no real title available?)
- Multiplicities: A deterministic view of nondeterminism
- On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
- Sur les séries associees à certains systèmes de Lindenmayer
- A note on commutative multivariate rational series
- Weighted tree automata with constraints
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
- Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
- Ultimate periodicity problem for linear numeration systems
- An iteration property of Lindenmayerian power series
- Homomorphism equivalence on etol languages†
- Semitopological semirings and pushdown automata
- Operatorenkalkül über freien Monoiden I: Strukturen
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Learning weighted automata
- Weighted asynchronous cellular automata
- Pattern statistics and Vandermonde matrices.
- Dynamic algebras: Examples, constructions, applications
- On some biologically motivated control devices for parallel rewriting
- The Coxeter relations and KP map for non-commuting symbols
- Intuitionistic fuzzy left k-ideals of semirings.
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- Some decidability results about regular and pushdown translations
- Remarks on commutative N-rational series
- Weighted picture automata and weighted logics
- Recognizable Picture Languages and Polyominoes
- On D0L systems with immigration
- On rational series and rational languages
- Context-free series on trees
- Another proof of Soittola's theorem
- Monomial reachability and zero controllability of discrete-time positive switched systems
- Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
- On recognizable and rational formal power series in partially commuting variables
- On language equations with invertible operations
- Combinatorial aspects of \(L\)-convex polyominoes
- Effective entropies and data compression
- On algebraic generalized zeta functions of formal power series
- Michel Fliess and non-commutative formal power series†
- Weighted tree automata with constraints
- Rational elements of summation semirings
- Splicing in abstract families of languages
- On the Commutative Equivalence of Algebraic Formal Series and Languages
- Finite sequentiality of unambiguous max-plus tree automata
- On two families of forests
- Some consequences of a Fatou property of the tropical semiring
- On some transducer equivalence problems for families of languages
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)