Predictable semiautomata

DOI10.1016/j.tcs.2009.05.010zbMath1193.68151OpenAlexW2913376930MaRDI QIDQ2271459

Janusz A. Brzozowski, Nicolae 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

predictorsimulationboundnondeterminismautomatonlook-aheadsemiautomatondelegator

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Quotient complexity of closed languages ⋮ Predictable semiautomata

Cites Work

• Generalizations of 1-deterministic regular languages
• Predictable semiautomata
• ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Algorithms and Computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Predictable semiautomata