Canonical systems which produce periodic sets

DOI10.1007/BF01705888zbMath0188.33104OpenAlexW4210905115MaRDI QIDQ5582344

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

zbMATH Keywords

languages, automata, networks

Related Items (5)

Path constraints in semistructured data ⋮ Combinatorial systems defined over one- and two-letter alphabets ⋮ Complexity results for prefix grammars ⋮ Deleting string rewriting systems preserve regularity ⋮ Computing by commuting.

Cites Work

• Regular canonical systems
• Three models for the description of language
• Formal Reductions of the General Combinatorial Decision Problem
• Unnamed Item
• Unnamed Item

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