Input-Position-Restricted Models of Language Acceptors
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6262566
- scientific article; zbMATH DE number 1099038
- Restricted Turing machines and language recognition
- Probabilistic Acceptors for Languages over Infinite Words
- scientific article; zbMATH DE number 1045384
- Incorporating linguistic structure into statistical language models
- Reshaping the context-free model: linguistic and algorithmic aspects
Cites work
- Affine Parikh automata
- Bounded Parikh automata
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Deterministic context free languages
- Deterministic stack transducers
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- On store languages of language acceptors
- On the containment and equivalence problems for two-way transducers
- One-reversal counter machines and multihead automata: revisited
- One-reversal counter machines and multihead automata: revisited
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Some decision problems concerning semilinearity and commutation.
- The complexity of decision problems for finite-turn multicounter machines
- The effect of end-markers on counter machines and commutativity
- Visibly pushdown automata and transducers with counters
This page was built for publication: Input-Position-Restricted Models of Language Acceptors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112180)