Finite automata and unary languages
Theoretical Computer Science
On sparseness, ambiguity and other decision problems for acceptors and transducers
3rd annual symposium on theoretical aspects of computer science on STACS 86
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
On measuring nondeterminism in regular languages
Information and Computation
On the degree of ambiguity of finite automata
Theoretical Computer Science
Intersection and union of regular languages and state complexity
Information Processing Letters
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
The parallel complexity of finite-state automata problems
Information and Computation
SIAM Journal on Computing
Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Pushdown automata with bounded nondeterminism and bounded ambiguity
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Communication complexity and parallel computing
Communication complexity and parallel computing
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM (JACM)
Descriptional complexity of deterministic finite automata with multiple initial states
Journal of Automata, Languages and Combinatorics
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Errata to: "finite automata and unary languages"
Theoretical Computer Science
Computations with a restricted number of nondeterministic steps.
Computations with a restricted number of nondeterministic steps.
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
Multiple-entry finite automata
Journal of Computer and System Sciences
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Unambiguity and its generalization to quantified ambiguity are important concepts in, e.g., automata and complexity theory. Basically, an unambiguous machine has at most one accepting computation path for each accepted word. While unambiguous pushdown automata induce a language family strictly in between the deterministic and general context-free languages, unambiguous finite automata capture the regular languages, that is, they are equally powerful as deterministic and nondeterministic finite automata. However, their descriptional capacity is significantly different. In the present paper, we summarize and discuss developments relevant to (un)ambiguous finite automata and pushdown automata problems from the descriptional complexity point of view. We do not prove these results but we merely draw attention to the big picture and some of the main ideas involved.