Higher order indexed monadic systems

DOI10.4230/LIPICS.FSTTCS.2011.469MaRDI QIDQ2911647zbMATH OpenFDO

Authors Teodor Knapik, Didier Caucal

Publication date 31 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2011.469

zbMATH Keywords

higher-order indexed languagesmonadic systems

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Regularity and context-freeness over word rewriting systems
• About the descriptive power of certain classes of finite string-rewriting systems
• scientific article; zbMATH DE number 1512609
• A complete rewriting system for a monoid of tree transformation classes
• On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems

Cited in

(1)

• On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems

This page was built for publication: Higher order indexed monadic systems

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