scientific article; zbMATH DE number 3189697
From MaRDI portal
Publication:5725992
zbMATH Open0116.33605MaRDI QIDQ5725992FDOQ5725992
Authors: Janusz Brzozowski 
Publication date: 1963
Title of this publication is not available (Why is that?)
Cited In (83)
- On equations for regular languages, finite automata, and sequential networks
- Reversal of binary regular languages
- Generalization of the double-reversal method of finding a canonical residual finite state automaton
- Transducers for the bidirectional decoding of prefix codes
- On solving star equations
- The size of power automata.
- On classes of tractable unrestricted regular expressions
- Yet another canonical nondeterministic automaton
- On the state complexity of reversals of regular languages
- A graph theoretic approach to automata minimality
- Bideterministic automata and minimal representations of regular languages
- Incremental DFA minimisation
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- Fuzzy terms
- Brzozowski type determinization for fuzzy automata
- On continuous nondeterminism and state minimality
- Coalgebraic minimization of automata by initiality and finality
- Circular Sturmian words and Hopcroft's algorithm
- Description and analysis of a bottom-up DFA minimization algorithm
- NFA reduction algorithms by means of regular inequalities
- Minimisation of automata
- Forbidden patterns for ordered automata
- Succinct representation of regular languages by Boolean automata. II
- Singular value automata and approximate minimization
- Observations on the complexity of regular expression problems
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- DFA minimization: double reversal versus split minimization algorithms
- Quantitative simulations by matrices
- Quotients and atoms of reversible languages
- La représentation ergodique d'un automate fini
- Hopcroft’s Algorithm and Cyclic Automata
- Left-handed completeness
- Closure properties of subregular languages under operations
- On the size complexity of hybrid networks of evolutionary processors
- A sufficient condition to polynomially compute a minimum separating DFA
- String matching algorithms and automata
- Succinct representation of regular languages by Boolean automata
- Canonization of max-min fuzzy automata
- Unrestricted complementation in language equations over a one-letter alphabet
- Expressive capacity of concatenation freeness
- On minimal realization for a fuzzy language and Brzozowski's algorithm
- A mesh of automata
- The word problem for \(\omega \)-terms over DA
- Average complexity of Moore's and Hopcroft's algorithms
- Characterizations of locally testable events
- The Booleanization of an inverse semigroup
- A congruence-based perspective on finite tree automata
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Standard Sturmian words and automata minimization algorithms
- The complexity of restricted regular expressions and the synthesis problem for finite automata
- Determination of finite automata accepting subregular languages
- Title not available (Why is that?)
- Theory of átomata
- Locally testable languages
- Title not available (Why is that?)
- Sorting and doubling techniques for set partitioning and automata minimization problems
- Five Determinisation Algorithms
- Regular languages viewed from a graph-theoretic perspective
- Coalgebraic constructions of canonical nondeterministic automata
- A polynomial double reversal minimization algorithm for deterministic finite automata
- Random deterministic automata
- Expressive completeness by separation for discrete time interval temporal logic with expanding modalities
- On the power of automata minimization in reactive synthesis
- More on deterministic and nondeterministic finite cover automata (extended abstract)
- Title not available (Why is that?)
- A string diagrammatic axiomatisation of finite-state automata
- Proof-directed program transformation: a functional account of efficient regular expression matching
- Concatenation-free languages
- More on deterministic and nondeterministic finite cover automata
- Minimisation in logical form
- A congruence-based perspective on automata minimization algorithms
- Measuring power of generalised definite languages
- Duality of Lattices Associated to Left and Right Quotients
- String editing under pattern constraints
- Reasoning About Regular Properties: A Comparative Study
- Canonical automata via distributive law homomorphisms
- Simplifying Alternating Automata for Emptiness Testing
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- Moore machines duality
- Incremental dead state detection in logarithmic time
- Yet another canonical nondeterministic automaton
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725992)
