Distance automata having large finite distance or finite ambiguity-Reference-Cited by-同舟云学术

Distance automata having large finite distance or finite ambiguity

Published:1993-06 Issue:2 Volume:26 Page:169-185
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Weber Andreas

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01202281.pdf

Reference27 articles.

1. A. Aho, J. Hopcroft, and J. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

2. S. Eilenberg,Automata, Languages, and Machines, Volume A, Academic Press, New York, 1974.

3. M. Garey and D. Johnson,Computers and Intractability, Freeman, San Francisco, CA, 1979.

4. P. Gohon, Automates de coût borné sur un alphabet à une lettre,RAIRO Inform, théor.,19 (1985), 351?357.

5. J. Goldstine, C. Kintala, and D. Wotschke, On measuring nondeterminism in regular languages,Inform. and Comput.,86 (1990), 179?194.

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

1. Regular Cost Functions, Part I: Logic and Algebra over Words;Logical Methods in Computer Science;2013-08-13

2. Limited Non-determinism Hierarchy of Counter Automata;Language and Automata Theory and Applications;2013

3. Bounded regular path queries in view-based data integration;Information Processing Letters;2009-06

4. The Theory of Stabilisation Monoids and Regular Cost Functions;Automata, Languages and Programming;2009

5. A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata;RAIRO - Theoretical Informatics and Applications;2008-06-03