Visit-bounded stack automata

DOI10.1007/s00224-023-10124-0OpenAlexW4385173070MaRDI QIDQ6056625

Ian McQuillan, Jozef jun. Jirásek

Publication date: 30 October 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-023-10124-0

zbMATH Keywords

semilinear languagesstack automatavisit-bounded automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computer science (68-XX) Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• One way finite visit automata
• Some decision problems concerning semilinearity and commutation.
• On families of full trios containing counter machine languages
• On counting functions and slenderness of languages
• Checking automata and one-way stack languages
• A Grammatical Characterization of One-Way Nondeterministic Stack Languages
• Stack automata and compiling
• On Context-Free Languages
• One-way stack automata
• Semilinearity of Families of Languages
• Space Complexity of Stack Automata Models