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