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
The State Complexity of Alternating Automata
Nathanaël Fijalkow
- 09 Jul 2018
TL;DR: This paper devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique: a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and a linear lower bound on the alternatingState complexity of the prime numbers written in binary.
5
•Dissertation
Des Codes Barres pour les Langages Rationnels
Ludovic Mignot
- 01 Jan 2010
TL;DR: In this paper, the authors propose a method of conversion classiques entre expressions rationnelles simples and automates finis for factorization of expressions using multi-tildes-barres.
5
On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States
Sven De Felice,Cyril Nicaud +1 more
- 26 Aug 2014
TL;DR: The average complexity of Brzozowski's minimization algorithm is super-polynomial even if the authors consider random deterministic automata with only one final state, and this result holds for alphabets with at least 3 letters.
•Journal Article
On some classes of tree automata and tree languages
TL;DR: This paper homomorphically represents the classes of nilpotent, deflnite, and mono- tone tree automata by means of quasi-cascade-products of unary nilpotents and unary deflnites in the flrst two cases, and by products of simpler tree Automata in the third case.
4
Structure Automata
TL;DR: By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained, which is a proper subset of the collection of regular sets and exactly the Boolean closure of the regular closed sets.
4