Distance automata having large finite distance or finite ambiguity
Author:
- 1 June 1993
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 26 (2) , 169-185
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the relation between ambiguity and nondeterminism in finite automataInformation and Computation, 1992
- On measuring nondeterminism in regular languagesInformation and Computation, 1990
- Improved limitedness theorems on finite automata with distance functionsTheoretical Computer Science, 1990
- Algorithms for determining relative star height and star heightInformation and Computation, 1988
- Automates de coût borné sur un alphabet à une lettreRAIRO. Informatique théorique, 1985
- Representation theorems on regular languagesJournal of Computer and System Sciences, 1983
- Limitedness theorem on finite automata with distance functionsJournal of Computer and System Sciences, 1982
- Amounts of nondeterminism in finite automataActa Informatica, 1980
- A decision procedure for the order of regular eventsTheoretical Computer Science, 1979
- Finite automata having cost functions: Nondeterministic modelsInformation and Control, 1978