On Families of Full Trios Containing Counter Machine Languages

DOI10.1007/978-3-662-53132-7_18zbMath1436.68173OpenAlexW2498145607MaRDI QIDQ2817390

Oscar H. Ibarra, Ian McQuillan

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_18

zbMATH Keywords

bounded languagescounter machinessemilinearityfull trios

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On finite-index indexed grammars and their restrictions ⋮ On Families of Full Trios Containing Counter Machine Languages ⋮ On families of full trios containing counter machine languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on blind and partially blind one-way multicounter machines
• Some decision problems concerning semilinearity and commutation.
• On Families of Full Trios Containing Counter Machine Languages
• On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• On ETOL systems of finite index
• CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

This page was built for publication: On Families of Full Trios Containing Counter Machine Languages