Skip header Section
Skip Bibliometrics Section
Automata: Theoretic Aspects of Formal Power SeriesMarch 1978
- Authors:
- Arto Salomaa,
- M. Soittola
Abstract
No abstract available.
Cited By
- Kostolányi P (2019). A Unifying Approach to Algebraic Systems Over Semirings, Theory of Computing Systems, 63:3, (615-633), Online publication date: 1-Apr-2019.
- Fülöp Z and Vogler H (2019). Weighted iterated linear control, Acta Informatica, 56:5, (447-469), Online publication date: 1-Jul-2019.
Fijalkow N, Ouaknine J, Pouly A, Sousa-Pinto J and Worrell J On the decidability of reachability in linear time-invariant systems Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, (77-86)- Cadilhac M, Krebs A and Mckenzie P (2018). The Algebraic Theory of Parikh Automata, Theory of Computing Systems, 62:5, (1241-1268), Online publication date: 1-Jul-2018.
- Gainutdinova A and Yakaryılmaz A (2018). Unary probabilistic and quantum automata on promise problems, Quantum Information Processing, 17:2, (1-17), Online publication date: 1-Feb-2018.
- Zhuang Y (2018). A generalized GouldenJackson cluster method and lattice path enumeration, Discrete Mathematics, 341:2, (358-379), Online publication date: 1-Feb-2018.
- Oulad-Naoui S, Cherroun H and Ziadi D (2017). A formal series-based unification of the frequent itemset mining approaches, Knowledge and Information Systems, 53:2, (439-477), Online publication date: 1-Nov-2017.
- Guillot P (2017). Cayley graphs and automatic sequences, Journal of Algebraic Combinatorics: An International Journal, 45:1, (245-270), Online publication date: 1-Feb-2017.
- Honkala J (2017). Discrete WatsonCrick dynamical systems, Theoretical Computer Science, 701:C, (125-131), Online publication date: 21-Nov-2017.
- Polley R and Staiger L (2016). Quasiperiods, subword complexity and the smallest pisot number, Journal of Automata, Languages and Combinatorics, 21:1, (93-106), Online publication date: 1-Jan-2016.
- Paul E On Finite and Polynomial Ambiguity of Weighted Tree Automata Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (368-379)
- Uezato Y and Minamide Y Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (393-405)
- Cassaigne J, Karhumäki J, Puzynina S and Whiteland M k-Abelian Equivalence and Rationality Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840, (77-88)
- Droste M and Perevoshchikov V (2016). Multi-weighted Automata and MSO Logic, Theory of Computing Systems, 59:2, (231-261), Online publication date: 1-Aug-2016.
- Chonev V, Ouaknine J and Worrell J (2016). On the Complexity of the Orbit Problem, Journal of the ACM, 63:3, (1-18), Online publication date: 1-Sep-2016.
- Thon M and Jaeger H (2015). Links between multiplicity automata, observable operator models and predictive state representations, The Journal of Machine Learning Research, 16:1, (103-147), Online publication date: 1-Jan-2015.
- Balle B and Mohri M On the Rademacher Complexity of Weighted Automata Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (179-193)
- Ouaknine J and Worrell J (2015). On linear recurrence sequences and loop termination, ACM SIGLOG News, 2:2, (4-13), Online publication date: 22-Apr-2015.
- Honkala J (2015). Products of matrices and recursively enumerable sets, Journal of Computer and System Sciences, 81:2, (468-472), Online publication date: 1-Mar-2015.
- Droste M and Dück S Weighted Automata and Logics for Infinite Nested Words Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (323-334)
- Honkala J (2014). A Kraft-McMillan inequality for free semigroups of upper-triangular matrices, Information and Computation, 239:C, (216-221), Online publication date: 1-Dec-2014.
- Abbad H and Laugerotte É Computing weights Proceedings of the 18th international conference on Implementation and Application of Automata, (24-35)
- Bell P, Halava V and Hirvensalo M (2013). Decision Problems for Probabilistic Finite Automata on Bounded Languages, Fundamenta Informaticae, 123:1, (1-14), Online publication date: 1-Jan-2013.
- Asarin E, Basset N, Degorre A and Perrin D Generating functions of timed languages Proceedings of the 37th international conference on Mathematical Foundations of Computer Science, (124-135)
- Moreno-Daniel A, Wilpon J and Juang B (2012). Index-based incremental language model for scalable directory assistance, Speech Communication, 54:3, (351-367), Online publication date: 1-Mar-2012.
- Bailly R and Denis F (2011). Absolute convergence of rational series is semi-decidable, Information and Computation, 209:3, (280-295), Online publication date: 1-Mar-2011.
- Constant M and Sigogne A MWU-aware part-of-speech tagging with a CRF model and lexical resources Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World, (49-56)
- Fülöp Z and Steinby M (2011). Varieties of recognizable tree series over fields, Theoretical Computer Science, 412:8-10, (736-752), Online publication date: 1-Mar-2011.
- Ésik Z and Kuich W A unifying Kleene theorem for weighted finite automata Rainbow of computer science, (76-89)
- Salomaa A On some biologically motivated control devices for parallel rewriting Computation, cooperation, and life, (181-190)
- Karhumäki J and Sallinen T Weighted finite automata Proceedings of the 10th international conference on Unconventional computation, (14-33)
- Fichtner I and Mathissen C Rational transformations and a kleene theorem for power series over rational monoids Algebraic Foundations in Computer Science, (94-111)
- Kuich W Algebraic systems and pushdown automata Algebraic Foundations in Computer Science, (228-256)
- Allauzen C, Kumar S, Macherey W, Mohri M and Riley M Expected sequence similarity maximization Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (957-965)
- Droste M and Meinecke I Describing average- and longtime-behavior by weighted MSO logics Proceedings of the 35th international conference on Mathematical foundations of computer science, (537-548)
- Droste M and Vogler H Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices Proceedings of the 14th international conference on Developments in language theory, (160-172)
- Holzer M and Kutrib M Descriptional complexity of (un)ambiguous finite state machines and pushdown automata Proceedings of the 4th international conference on Reachability problems, (1-23)
- Bell P, Halava V and Hirvensalo M On the joint spectral radius for bounded matrix languages Proceedings of the 4th international conference on Reachability problems, (91-103)
- Kupferman O and Tamir T Coping with selfish on-going behaviors Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (501-516)
- Allauzen C, Cortes C and Mohri M Large-scale training of SVMs with automata kernels Proceedings of the 15th international conference on Implementation and application of automata, (17-27)
- Droste M and Meinecke I Regular expressions on average and in the long run Proceedings of the 15th international conference on Implementation and application of automata, (211-221)
- Kotek T and Makowsky J Definability of combinatorial functions and their linear recurrence relations Fields of logic and computation, (444-462)
- Cortes C and Mohri M Learning with Weighted Transducers Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, (14-22)
- Kuske D (2009). Weighted and unweighted trace automata, Acta Cybernetica, 19:2, (393-410), Online publication date: 1-Feb-2009.
- Laohakosol V and Tangsupphathawat P (2009). Positivity of third order linear recurrence sequences, Discrete Applied Mathematics, 157:15, (3239-3248), Online publication date: 1-Aug-2009.
- Brough M, Khoussainov B and Nelson P Sequential Automatic Algebras Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms, (84-93)
- Boldi P, Lonati V, Radicioni R and Santini M (2008). The number of convex permutominoes, Information and Computation, 206:9-10, (1074-1083), Online publication date: 1-Sep-2008.
- Allauzen C, Mohri M and Talwalkar A Sequence kernels for predicting protein essentiality Proceedings of the 25th international conference on Machine learning, (9-16)
- Droste M, Sakarovitch J and Vogler H (2008). Weighted automata with discounting, Information Processing Letters, 108:1, (23-28), Online publication date: 1-Sep-2008.
- Droste M and Quaas K A Kleene-Schützenberger theorem for weighted timed automata Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (142-156)
- Allauzen C, Riley M, Schalkwyk J, Skut W and Mohri M OpenFst Proceedings of the 12th international conference on Implementation and application of automata, (11-23)
- Droste M and Rahonis G Weighted automata and weighted logics with discounting Proceedings of the 12th international conference on Implementation and application of automata, (73-84)
- Albert J and Tischler G On generalizations of weighted finite automata and graphics applications Proceedings of the 2nd international conference on Algebraic informatics, (1-22)
- Castiglione G and Vaglica R Recognizable picture languages and polyominoes Proceedings of the 2nd international conference on Algebraic informatics, (160-171)
- Honkala J (2006). On the Problem Whether the Image of an N-Rational Series Equals, Fundamenta Informaticae, 73:1,2, (127-132), Online publication date: 1-Apr-2006.
- Honkala J (2006). On the Problem Whether the Image of an N-Rational Series Equals, Fundamenta Informaticae, 73:1,2, (127-132), Online publication date: 1-Oct-2006.
- Constantinescu S and Ilie L The lempel-ziv complexity of fixed points of morphisms Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (280-291)
- Droste M and Rahonis G Weighted automata and weighted logics on infinite words Proceedings of the 10th international conference on Developments in Language Theory, (49-58)
- Cortes C, Mohri M, Rastogi A and Riley M Efficient computation of the relative entropy of probabilistic automata Proceedings of the 7th Latin American conference on Theoretical Informatics, (323-336)
- Kuske D Weighted asynchronous cellular automata Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (684-695)
- Mäurer I Weighted picture automata and weighted logics Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (313-324)
- Meinecke I Weighted logics for traces Proceedings of the First international computer science conference on Theory and Applications, (235-246)
- Cortes C, Mohri M and Rastogi A On the computation of some standard distances between probabilistic automata Proceedings of the 11th international conference on Implementation and Application of Automata, (137-149)
- Habrard A, Denis F and Esposito Y Using pseudo-stochastic rational languages in probabilistic grammatical inference Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications, (112-124)
- Goldwurm M and Lonati V (2006). Pattern statistics and Vandermonde matrices, Theoretical Computer Science, 356:1, (153-169), Online publication date: 5-May-2006.
- Halava V, Harju T and Hirvensalo M (2006). Positivity of second order linear recurrent sequences, Discrete Applied Mathematics, 154:3, (447-451), Online publication date: 1-Mar-2006.
- Massazza P The inclusion problem for unambiguous rational trace languages Proceedings of the 9th international conference on Developments in Language Theory, (350-361)
- Béal M, Lombardy S and Sakarovitch J On the equivalence of Z-automata Proceedings of the 32nd international conference on Automata, Languages and Programming, (397-409)
- Droste M and Gastin P Weighted automata and weighted logics Proceedings of the 32nd international conference on Automata, Languages and Programming, (513-525)
- Goldwurm M and Lonati V Pattern occurrences in multicomponent models Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (680-692)
- Bousquet-Mélou M Algebraic generating functions in enumerative combinatorics and context-free languages Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (18-35)
- Honkala J (2005). An n 2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet, Journal of Computer and System Sciences, 71:4, (506-519), Online publication date: 1-Nov-2005.
- Cortes C, Mohri M and Weston J A general regression technique for learning transductions Proceedings of the 22nd international conference on Machine learning, (153-160)
- Wich K (2005). Sublogarithmic ambiguity, Theoretical Computer Science, 345:2-3, (473-504), Online publication date: 22-Nov-2005.
- Choffrut C, Goldwurm M and Lonati V On the maximum coefficients of rational formal series in commuting variables Proceedings of the 8th international conference on Developments in Language Theory, (114-126)
- Cortes C, Haffner P and Mohri M (2004). Rational Kernels: Theory and Algorithms, The Journal of Machine Learning Research, 5, (1035-1062), Online publication date: 1-Dec-2004.
- Allauzen C, Mohri M and Riley M Statistical modeling for unit selection in speech synthesis Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (55-es)
- Champarnaud J and Duchamp G (2004). Derivatives of rational expressions and related theorems, Theoretical Computer Science, 313:1, (31-44), Online publication date: 16-Feb-2004.
- Allauzen C and Mohri M (2004). An optimal pre-determinization algorithm for weighted transducers, Theoretical Computer Science, 328:1-2, (3-18), Online publication date: 29-Nov-2004.
- Kuske D and Meinecke I (2004). Branching automata with costs, Theoretical Computer Science, 328:1-2, (53-75), Online publication date: 29-Nov-2004.
- Ravikumar B and Eisman G (2004). Weak minimization of DFA, Theoretical Computer Science, 328:1-2, (113-133), Online publication date: 29-Nov-2004.
- Allauzen C and Mohri M An efficient pre-determinization algorithm Proceedings of the 8th international conference on Implementation and application of automata, (83-95)
- Honkala J (2003). On images of D0L and DT0L power series, Theoretical Computer Science, 290:3, (1869-1882), Online publication date: 3-Jan-2003.
- Muchnik A (2003). One application of real-valued interpretation of formal power series, Theoretical Computer Science, 290:3, (1931-1946), Online publication date: 3-Jan-2003.
- Honkala J (2003). Decidability results for Watson--Crick D0L systems with nonregular triggers, Theoretical Computer Science, 302:1-3, (481-488), Online publication date: 13-Jun-2003.
- Droste M and Kuske D Skew and infinitary formal power series Proceedings of the 30th international conference on Automata, languages and programming, (426-438)
- Allauzen C, Mohri M and Roark B Generalized algorithms for constructing statistical language models Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1, (40-47)
- Bertoni A, Mereghetti C and Palano B Quantum computing Proceedings of the 7th international conference on Developments in language theory, (1-20)
- Kuske D and Meinecke I Branching automata with costs Proceedings of the 8th international conference on Implementation and application of automata, (150-162)
- Béal M and Perrin D (2003). On the generating sequences of regular languages on k symbols, Journal of the ACM, 50:6, (955-980), Online publication date: 1-Nov-2003.
- Honkala J (2002). A new class of algebraic series having a decidable equivalence problem, Fundamenta Informaticae, 53:3-4, (315-320), Online publication date: 1-Aug-2002.
- Honkala J (2002). A new class of algebraic series having a decidable equivalence problem, Fundamenta Informaticae, 53:3,4, (315-320), Online publication date: 30-May-2002.
- Mohri M Edit-distance of weighted automata Proceedings of the 7th international conference on Implementation and application of automata, (1-23)
- Kuich W Forty years of formal power series in automata theory A half-century of automata theory, (49-71)
- Gil J (2001). Subtyping arithmetical types, ACM SIGPLAN Notices, 36:3, (276-289), Online publication date: 1-Mar-2001.
- Gil J Subtyping arithmetical types Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (276-289)
- Abney S, McAllester D and Pereira F Relating probabilistic grammars and automata Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (542-549)
- Goodman J (1999). Semiring parsing, Computational Linguistics, 25:4, (573-605), Online publication date: 1-Dec-1999.
- Mohri M and Pereira F Dynamic compilation of weighted context-free grammars Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2, (891-897)
- Honkala J (1997). Decision Problems Concerning a Power Series Generalization of DTOL Systems, Fundamenta Informaticae, 32:3,4, (341-348), Online publication date: 1-Dec-1997.
- Mohri M (1997). Finite-state transducers in language and speech processing, Computational Linguistics, 23:2, (269-311), Online publication date: 1-Jun-1997.
- Honkala J and Kuich W (1996). ON A POWER SERIES GENERALIZATION OF ETOL LANGUAGES, Fundamenta Informaticae, 25:3,4, (257-270), Online publication date: 1-Dec-1996.
- Mohri M and Sproat R An efficient compiler for weighted rewrite rules Proceedings of the 34th annual meeting on Association for Computational Linguistics, (231-238)
- Bergadano F, Catalano D and Varricchio S Learning Sat-k-DNF formulas from membership queries Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (126-130)
- Schabes Y (1995). Review of "The functional treatment of parsing" by René Leermakers. Kluwer Academic Publishers 1993., Computational Linguistics, 21:1, (112-115), Online publication date: 1-Mar-1995.
- Dymetman M A generalized Greibach Normal Form for definite clause grammars Proceedings of the 14th conference on Computational linguistics - Volume 1, (366-372)
- Harju T and Karhumäki J Decidability of the multiplicity equivalence of multitape finite automata Proceedings of the twenty-second annual ACM symposium on Theory of Computing, (477-481)
Recommendations
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03: Proceedings of the 7th international conference on Developments in language theoryFlip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for ...