Further closure properties of input-driven pushdown automata
From MaRDI portal
Recommendations
- Further closure properties of input-driven pushdown automata
- State complexity of operations on input-driven pushdown automata
- State complexity of operations on input-driven pushdown automata
- Towards exact state complexity bounds for input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
Cites work
- Adding nesting structure to words
- Descriptional complexity of unambiguous input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Effective constructions in well-partially-ordered free monoids
- 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 2068872 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Input-driven languages are linear conjunctive
- Intersection and union of regular languages and state complexity
- More on the Size of Higman-Haines Sets: Effective Constructions
- Nondeterministic state complexity of nested word automata
- Nondeterministic state complexity of proportional removals
- On free monoids partially ordered by embedding
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- On the state complexity of scattered substrings and superstrings
- Operational state complexity of nested word automata
- Ordering by Divisibility in Abstract Algebras
- Parikh's theorem: a simple and direct automaton construction
- Regularity-preserving relations
- State complexity of cyclic shift
- State complexity of deletion and bipolar deletion
- State complexity of insertion
- State complexity of operations on input-driven pushdown automata
- The quotient operation on input-driven pushdown automata
- Towards exact state complexity bounds for input-driven pushdown automata
Cited in
(12)- Towards exact state complexity bounds for input-driven pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- State complexity of operations on input-driven pushdown automata
- The quotient operation on input-driven pushdown automata
- State complexity of operations on input-driven pushdown automata
- Tinput-driven pushdown, counter, and stack automata
- Digging input-driven pushdown automata
- State complexity of the quotient operation on input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
This page was built for publication: Further closure properties of input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919707)
