On equations for regular languages, finite automata, and sequential networks

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (63)

Descriptional Complexity of the Forever Operator
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
Theoretical computer science: computational complexity
Equations and regular-like expressions for afa
Minimisation in logical form
Operations on Boolean and Alternating Finite Automata
Reasoning About Regular Properties: A Comparative Study
A Nivat theorem for weighted alternating automata over commutative semirings
An automata-theoretic approach to linear temporal logic
On the simplest centralizer of a language
Implicit language equations: existence and uniqueness of solutions
On generalized language equations
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
Succinct representation of regular sets using gotos and Boolean variables
Decision procedures for inductive Boolean functions based on alternating automata
From bidirectionality to alternation.
On classes of tractable unrestricted regular expressions
Generalized language equations with multiple solutions
Partial derivatives of regular expressions and finite automaton constructions
Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
ON THE ROOT OF LANGUAGES
Square on Deterministic, Alternating, and Boolean Finite Automata
Generalized acceptance, succinctness and supernondeterministic finite automata.
A symbolic decision procedure for symbolic alternating finite automata
Succinct representation of regular languages by Boolean automata. II
On the closure properties of linear conjunctive languages.
A Rice-style theorem for parallel automata
Alternation in two-way finite automata
Transformation from PLTL to automata via NFGs
Unresolved systems of language equations: expressive power and decision problems
Kleene closure and state complexity
Descriptional and Computational Complexity of Finite Automata
Alternating automata and temporal logic normal forms
The commutation of finite sets: A challenging problem
Decision problems for language equations
Succinct representation of regular languages by Boolean automata
Unrestricted complementation in language equations over a one-letter alphabet
The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
Alternating automata on infinite trees
The complexity of concatenation on deterministic and alternating finite automata
Alternating finite automata and star-free languages
BOOLEAN FUZZY SETS
Efficient implementation of regular languages using reversed alternating finite automata
Manipulation of regular expressions using derivatives: an overview
Automatic winning shifts
Domain mu-calculus
Alternating automata: Unifying truth and validity checking for temporal logics
Language equations
Construction of a Deterministicω-Automaton Using Derivatives
Inferring program specifications in polynomial-time
Descriptional and computational complexity of finite automata -- a survey
Trace semantics via determinization
Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
Descriptional complexity of regular languages
Concurrent Dynamic Algebra
Taming Multirelations
Linear Parsing Expression Grammars
Two-way automata and length-preserving homomorphisms
On the role of complementation in implicit language equations and relations
Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997
Model checking open systems with alternating projection temporal logic
Rewriting extended regular expressions
State-complexity of finite-state devices, state compressibility and incompressibility

This page was built for publication: On equations for regular languages, finite automata, and sequential networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600253)