Recognizing Shuffled Languages-Reference-Cited by-同舟云学术

Recognizing Shuffled Languages

Published:2011 Issue: Volume: Page:142-154
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Berglund Martin,Björklund Henrik,Högberg Johanna

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21254-3_10

Reference23 articles.

1. Barton, G.E.: On the complexity of ID/LP parsing 1. Comput. Linguist. 11(4), 205–218 (1985)

2. Berglund, M., Björklund, H., Högberg, J.: Recognizing shuffled languages. Technical Report UMINF 11.01, Computing Sci., Umeå University (2011), http://www8.cs.umu.se/research/uminf/index.cgi

3. Biegler, F., Daley, M., McQuillan, I.: On the shuffle automaton size for words. In: DCFS, pp. 79–89 (2009)

4. Lecture Notes in Computer Science;H. Björklund,2007

5. Bloom, S.B., Ésik, Z.: Axiomatizing shuffle and concatenation in languages. Information and Comptuation 139(1), 62–91 (1997)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting;Database Systems for Advanced Applications;2022

2. Learning Finite Automata with Shuffle;Advances in Knowledge Discovery and Data Mining;2021

3. A Simulator for Event-oriented Data in Flexible Assembly System Fault Prediction;Procedia Computer Science;2017

4. Quotients of Unbounded Parallelism;Theoretical Aspects of Computing - ICTAC 2015;2015

5. Schemas for Unordered XML on a DIME;Theory of Computing Systems;2014-12-16