Visit-bounded stack automata

DOI10.1007/978-3-031-05578-2_15OpenAlexW4285278578MaRDI QIDQ2163998

Ian McQuillan, Jozef jun. Jirásek

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_15

zbMATH Keywords

semilinear languagesstack automatavisit-bounded automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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
• Stack automata and compiling
• On Context-Free Languages
• One-way stack automata
• Semilinearity of Families of Languages