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

zbMATH Open1251.68136MaRDI QIDQ2882391FDOQ2882391

Authors: Peter Leupold, Friedrich Otto 

Publication date: 4 May 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: http://iospress.metapress.com/content/108447tjq877hg32/fulltext.html

Recommendations

• McNaughton families of languages.
• scientific article; zbMATH DE number 2087237
• Higher order indexed monadic systems
• A characterisation of deterministic context-free languages by means of right-congruences
• About the descriptive power of certain classes of finite string-rewriting systems

zbMATH Keywords

context-free languagesinverse context-free systemsMcNaughton families of languagesmonadic string-rewriting systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (3)

• Higher order indexed monadic systems
• McNaughton families of languages.
• Title not available (Why is that?)

This page was built for publication: On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems

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