Author:
Otto Friedrich,Wang Qichao
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference25 articles.
1. Bollig B, Gastin P, Monmege B, Zeitoun M (2010) Pebble weighted automata and transitive closure logics. In: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG (eds) ICALP 2010, Part II, Lecture notes in computer science, Springer, Heidelberg, vol 6199, pp 587–598
2. Book RV, Otto F (1993) String-rewriting systems. Texts and monographs in computer science. Springer, New York
3. Chatterjee K, Doyen L, Henzinger TA (2009) Probabilistic weighted automata. In: Bravetti M, Zavattaro G (eds) CONCUR 2009, Proc., Lecture Notes in Computer Science, vol 5710, Springer, Heidelberg, pp 244–258
4. Dahlhaus E, Warmuth MK (1986) Membership for growing context-sensitive grammars is polynomial. J Comput Syst Sci 33:456–472
5. Droste M, Götze D (2013) The support of nested weighted automata. In: Bensch S, Drewes F, Freund R, Otto F (eds) NCMA 2013, Proc., Oesterreichische Computer Gesellschaft, Wien, books@ocg.at, Band 294, pp 101–116
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献