Canonical systems which produce periodic sets

DOI10.1007/BF01705888zbMATH Open0188.33104OpenAlexW4210905115MaRDI QIDQ5582344FDOQ5582344

Authors: J. Richard Buchi, William H. Hosken 

Publication date: 1970

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01705888

Recommendations

• Periodicity and ultimate periodicity of D0L systems
• Regularity of sets of initial strings of periodic D0L-systems
• scientific article; zbMATH DE number 3194923
• scientific article; zbMATH DE number 3850487
• It is decidable whether a monadic thue system is canonical over a regular set

zbMATH Keywords

languages, automata, networks

Cites Work

• Three models for the description of language
• Formal Reductions of the General Combinatorial Decision Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular canonical systems

Cited In (6)

• Complexity results for prefix grammars
• Path constraints in semistructured data
• Title not available (Why is that?)
• Deleting string rewriting systems preserve regularity
• Computing by commuting.
• Combinatorial systems defined over one- and two-letter alphabets

This page was built for publication: Canonical systems which produce periodic sets

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