Sequential?
From MaRDI portal
Publication:2490822
DOI10.1016/J.TCS.2006.01.028zbMATH Open1160.68419OpenAlexW4205548359MaRDI QIDQ2490822FDOQ2490822
Authors: Sylvain Lombardy, Jacques Sakarovitch 
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.028
Recommendations
- On deterministic weighted automata
- scientific article; zbMATH DE number 2040921
- Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
- A note on the equivalence problem of rational formal power series
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the determinization of weighted finite automata
- Limitedness theorem on finite automata with distance functions
- Title not available (Why is that?)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Automata, Languages and Programming
- On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra
- Title not available (Why is that?)
- Sur une variante des fonctions séquentielles
- Title not available (Why is that?)
- Derivatives of rational expressions with multiplicity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- On the degree of ambiguity of finite automata
- Transductions des langages de Chomsky
- Sequential Functions
- A proof of Choffrut's theorem on subsequential functions
- Minimizing subsequential transducers: a survey.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multitape one-way nonwriting automata
- Finite-valued distance automata
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Economy of description for single-valued transducers
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Asymptotic behavior in a heap model with two pieces
- La finitude des représentations linéaires des semi-groupes est decidable
Cited In (21)
- Sequential order under CH
- Bideterministic weighted automata
- Over Which Monoids is the Transducer Determinization Procedure Applicable?
- Polynomially ambiguous unary weighted automata over fields
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
- Finitely ambiguous and finitely sequential weighted automata over fields
- Noncommutative rational Pólya series
- Bideterministic weighted automata
- Determinization of timed Petri nets behaviors
- Introduction to tropical series and wave dynamic on them
- Determinisability of unary weighted automata over the rational numbers
- On deterministic weighted automata
- Title not available (Why is that?)
- A contribution to the determinization of max-plus automata
- How does the Gerrymander Sequence Continue?
- Degree of sequentiality of weighted automata
- Sequentiality of string-to-context transducers
- Supervisory control of (max,+) automata: extensions towards applications
- Compositions of (max,+) automata
- Finite ambiguity and finite sequentiality in weighted automata over fields
- On some decidability questions concerning supports of rational series
This page was built for publication: Sequential?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490822)
