A new characterization of nondeterministically recognizable families of languages

zbMATH Open0732.68069MaRDI QIDQ808715FDOQ808715

Authors: Chuanhong Wang 

Publication date: 1991

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Recommendations

• Publication:5751955
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Abstract families of deterministic languages
• Non deterministic recognizability of fuzzy languages
• Uniform and nonuniform recognizability.

zbMATH Keywords

nondeterministically recognizable familiesrelative self-compatibility of families

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Families of automata characterizing context-sensitive languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Title not available (Why is that?)

This page was built for publication: A new characterization of nondeterministically recognizable families of languages

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