scientific article; zbMATH DE number 4001492
From MaRDI portal
Publication:4727438
Recommendations
Cited in
(24)- On the degree of ambiguity of finite automata
- The parallel complexity of finite-state automata problems
- On the relation between ambiguity and nondeterminism in finite automata
- A note on finitely ambiguous distance automata
- Opacity of finite automata
- On the finite degree of ambiguity of finite tree automata
- Decidability results on the existence of lookahead delegators for NFA
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- General Algorithms for Testing the Ambiguity of Finite Automata
- Bounded Delay and Concurrency for Earliest Query Answering
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 4049114 (Why is no real title available?)
- scientific article; zbMATH DE number 4092773 (Why is no real title available?)
- scientific article; zbMATH DE number 17556 (Why is no real title available?)
- scientific article; zbMATH DE number 17828 (Why is no real title available?)
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Ambiguity, nondeterminism and state complexity of finite automata
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- Queries on XML streams with bounded delay and concurrency
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
- SOFSEM 2006: Theory and Practice of Computer Science
- Cycle height of finite automata
- New techniques for proving the decidability of equivalence problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4727438)
