Semilinearity of Families of Languages
From MaRDI portal
Publication:5859668
DOI10.1142/S0129054120420095zbMath1458.68102MaRDI QIDQ5859668
Ian McQuillan, Oscar H. Ibarra
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (3)
Visit-bounded stack automata ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Visit-bounded stack automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The effect of end-markers on counter machines and commutativity
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Linear indexed languages
- Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 -- July 4, 2003. Proceedings
- Semilinearity of families of languages
- Counter machines and verification problems.
- Some decision problems concerning semilinearity and commutation.
- Eliminating the storage tape in reachability constructions.
- On the structure of the counting function of sparse context-free languages.
- AFL with the semilinear property
- An Approach to Computing Downward Closures
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- On ETOL systems of finite index
- ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS
- On Context-Free Languages
- Indexed Grammars—An Extension of Context-Free Grammars
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Variations of checking stack automata: obtaining unexpected decidability properties
- Decidable models of integer-manipulating programs with recursive parallelism
This page was built for publication: Semilinearity of Families of Languages
