Predictable semiautomata

DOI10.1016/J.TCS.2009.05.010MaRDI QIDQ2271459zbMATH OpenOpenAlexFDO

Authors Janusz Brzozowski, N. Sântean

Publication date 7 August 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.05.010

zbMATH Keywords

simulationautomatonboundnondeterminismpredictorlook-aheadsemiautomatondelegator

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A criterion for a partial prediction of general regular superevents
• Representation of a class of nondeterministic semiautomata by canonical words.
• On the degree of ambiguity of finite automata

Cites work

• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3310090 (Why is no real title available?)
• Algorithms and Computation
• Generalizations of 1-deterministic regular languages
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• On the existence of lookahead delegators for nfa
• Predictable semiautomata

Cited in

(2)

• A criterion for a partial prediction of general regular superevents
• Predictable semiautomata

This page was built for publication: Predictable semiautomata

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