Markers and deterministic acceptors for non-deterministic languages

DOI10.25596/JALC-2009-033MaRDI QIDQ5192989zbMATH OpenFDO

Authors Helmut Jürgensen

Publication date 10 August 2009

Full work available at URL https://doi.org/10.25596/JALC-2009-033

zbMATH Keywords

automatadeterminismformal languagesmarkersNerode congruencesnondeterminismrelativized solid codessolid codes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Combinatorics on words (68R15) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 58314
• Prefix pushdown automata and their simplification
• Detecting palindromes, patterns and borders in regular languages
• Context-free languages and primitive words
• Minimal partial languages and automata

Cited in

(2)

• Automata for solid codes
• Relativized codes

This page was built for publication: Markers and deterministic acceptors for non-deterministic languages

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