Author:
Ibarra Oscar H.,McQuillan Ian
Publisher
Springer Nature Switzerland
Reference29 articles.
1. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci. 8(3), 315–332 (1974)
2. Baumann, P., et al.: Unboundedness problems for machines with reversal-bounded counters. In: 25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) (2023)
3. Carpi, A., D’Alessandro, F., Ibarra, O.H., McQuillan, I.: Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. Theoret. Comput. Sci. 862, 97–118 (2021)
4. Crespi-Reghizzi, S., Pietro, P.S.: Deterministic counter machines and parallel matching computations. In: Proceedings of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, vol. 7982, pp. 280–291 (2013)
5. Czerwiński, W., Hofman, P.: Language inclusion for boundedly-ambiguous vector addition systems is decidable. In: Klin, B., Lasota, S., Muscholl, A. (eds.) Proceedings of the 33rd International Conference on Concurrency Theory (CONCUR 2022), pp. 16:1–16:22 (2022)