Open AccessBook
Canonical regular expressions and minimal state graphs for definite events
Janusz A. Brzozowski
- 01 Jan 1962
340
About: The article was published on 01 Jan 1962. and is currently open access. The article focuses on the topics: Generalized star height problem & State (functional analysis).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Generating fluent embedded domain-specific languages with subchaining
Tomoki Nakamaru,Kazuhiro Ichikawa,Tetsuro Yamazaki,Shigeru Chiba +3 more
- 01 Feb 2019
TL;DR: The contribution of this paper is the development of a translation method from a grammar to such an EDSL, modeled as the construction of a set of single-state real-time deterministic pushdown automata (RPAs).
4
On the Power of Automata Minimization in Reactive Synthesis
Shufang Zhu,Lucas M. Tabajara,Geguang Pu,Moshe Y. Vardi +3 more
- 17 Sep 2021
TL;DR: In this paper, the Hopcroft and Brzozowski algorithms are compared in the context of semi-symbolic (explicit states, symbolic transition functions) automata representation.
4
On single-loop realizations of sequential machines
TL;DR: A method is presented for testing whether a given flow table possesses a feedback partition, and if one exists, the method can generate all such partitions, and the corresponding single-loop realizations are easily found.
4
•Posted Content
Most Complex Regular Right-Ideal Languages
TL;DR: In this paper, it was shown that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n has n left quotients and is most complex under the following measures of complexity.
4
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
Bruce W. Watson
- 24 Jul 2000
TL;DR: In this paper, the authors combine two of Brzozowski's algorithms and refine them, yielding a single algorithm which constructs a minimal deterministic finite automaton (DFA) from a regular expression.
4