On Families of Full Trios Containing Counter Machine Languages

DOI10.1007/978-3-662-53132-7_18MaRDI QIDQ2817390zbMATH OpenOpenAlexFDO

Authors 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 machinesfull triossemilinearity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On families of full trios containing counter machine languages
• On bounded semilinear languages, counter machines, and finite-index ET0L
• Refining the hierarchy of blind multicounter languages and twist-closed trios.
• scientific article; zbMATH DE number 5155118
• The expressiveness of a family of finite set languages
• The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
• On a family of L languages resulting from systolic tree automata
• On some transducer equivalence problems for families of languages
• Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES

Cites work

• CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• On bounded semilinear languages, counter machines, and finite-index ET0L
• On ETOL systems of finite index
• On Families of Full Trios Containing Counter Machine Languages
• Remarks on blind and partially blind one-way multicounter machines
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Some decision problems concerning semilinearity and commutation.
• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages

Cited in

(7)

• Refining the hierarchy of blind multicounter languages and twist-closed trios.
• On families of full trios containing counter machine languages
• On Families of Full Trios Containing Counter Machine Languages
• On bounded semilinear languages, counter machines, and finite-index ET0L
• scientific article; zbMATH DE number 1136082 (Why is no real title available?)
• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
• Semilinearity of families of languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817390)