The effect of end-markers on counter machines and commutativity
From MaRDI portal
Publication:265080
DOI10.1016/J.TCS.2016.02.034zbMATH Open1338.68150OpenAlexW2288306272MaRDI QIDQ265080FDOQ265080
Authors: Oscar H. Ibarra, Ian McQuillan 
Publication date: 1 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.034
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cônes rationnels commutatifs
- Reversal-bounded multipushdown machines
- Some decision problems concerning semilinearity and commutation.
- Bounded Parikh automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Affine Parikh automata
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Title not available (Why is that?)
- Commutative languages and their composition by consensual methods
- Automata with Reversal-Bounded Counters: A Survey
- Deterministic context free languages
- On Context-Free Languages
- Title not available (Why is that?)
Cited In (9)
- Input-Position-Restricted Models of Language Acceptors
- Title not available (Why is that?)
- On bounded semilinear languages, counter machines, and finite-index ET0L
- On the complexity of decision problems for some classes of machines and applications
- State grammars with stores
- On store languages of language acceptors
- On store languages and applications
- Semilinearity of families of languages
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
This page was built for publication: The effect of end-markers on counter machines and commutativity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265080)
