Descriptional complexity of unambiguous input-driven pushdown automata
From MaRDI portal
(Redirected from Publication:484313)
Recommendations
- Descriptional complexity of input-driven pushdown automata
- Descriptional complexity of unambiguous nested word automata
- Towards exact state complexity bounds for input-driven pushdown automata
- State complexity of operations on input-driven pushdown automata
- Input-Driven Pushdown Automata with Limited Nondeterminism
Cites work
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- scientific article; zbMATH DE number 3696500 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- Adding nesting structure to words
- An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
- Automata, Languages and Programming
- Communication complexity method for measuring nondeterminism in finite automata
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Complementing two-way finite automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
- Descriptional and computational complexity of finite automata -- a survey
- Descriptional complexity of input-driven pushdown automata
- Intersection and union of regular languages and state complexity
- Limitations of lower bound methods for deterministic nested word automata
- Mathematical Foundations of Computer Science 2005
- Minimizing Variants of Visibly Pushdown Automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Nondeterministic state complexity of nested word automata
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- On the relation between ambiguity and nondeterminism in finite automata
- Operational state complexity of nested word automata
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- State complexity of operations on input-driven pushdown automata
- State complexity of some operations on binary regular languages
- Streaming tree automata
- Unambiguous finite automata over a unary alphabet
- Visibly pushdown languages
Cited in
(16)- scientific article; zbMATH DE number 4209587 (Why is no real title available?)
- State complexity of the quotient operation on input-driven pushdown automata
- Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- Input-driven pushdown automata on well-nested infinite strings
- scientific article; zbMATH DE number 7444008 (Why is no real title available?)
- Edit distance neighbourhoods of input-driven pushdown automata
- Descriptional complexity of input-driven pushdown automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- scientific article; zbMATH DE number 1759446 (Why is no real title available?)
- Descriptional complexity of unambiguous nested word automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Unambiguity in automata theory
- State complexity of operations on input-driven pushdown automata
- Towards exact state complexity bounds for input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
This page was built for publication: Descriptional complexity of unambiguous input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484313)
