scientific article; zbMATH DE number 3189697

Cited in

(90)

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

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)