Search

Your search keyword '"Deterministic automaton"' showing total 2,339 results

Search Constraints

Start Over You searched for: Descriptor "Deterministic automaton" Remove constraint Descriptor: "Deterministic automaton"
2,339 results on '"Deterministic automaton"'

Search Results

3. Forward Bisimulations for Nondeterministic Symbolic Finite Automata

4. On Minimization of Deterministic Automaton with Rough Output

5. [Untitled]

6. Basic Notions

7. Derived-Term Automata for Extended Weighted Rational Expressions

9. Models of Dynamical Systems

10. Containment of Monadic Datalog Programs via Bounded Clique-Width

11. Nested Antichains for WS1S

12. Looking at Mean-Payoff Through Foggy Windows

13. On the Disambiguation of Weighted Automata

14. On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism

15. Regular Varieties of Automata and Coequations

16. Unambiguity in Automata Theory

17. Logics for Unordered Trees with Data Constraints on Siblings

18. Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata

19. Random Deterministic Automata

20. Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions

21. From LTL to Deterministic Automata: A Safraless Compositional Approach

22. Automata Learning: A Categorical Perspective

23. Reactive Automata

25. Words, Trees and Automata Minimization

26. Trace Semantics via Generic Observations

27. Nondeterminism in the Presence of a Diverse or Unknown Future

28. Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure

29. Parameterized Weighted Containment

30. Unambiguous Automata Denoting Finitely Sequential Functions

31. A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

33. Left-Handed Completeness

34. Quantitative Languages Defined by Functional Automata

35. Trace Semantics via Determinization

36. Descriptional Complexity of Deterministic Regular Expressions

37. Brzozowski’s Algorithm (Co)Algebraically

38. The Software Package BALM

39. Manipulations of FSMs Represented as Sequential Circuits

40. Exploitation of Flexibility in Sequential Networks

41. Stabilization of Recurrent Fuzzy Systems via Sum of Squares-based Hybrid Control

42. On Intransitive Non-interference in Some Models of Concurrency

43. Game Quantifiers on Automatic Presentations

44. Regular Splicing Languages Must Have a Constant

45. Büchi Automata Can Have Smaller Quotients

46. From Mtl to Deterministic Timed Automata

47. Linking Algebraic Observational Equivalence and Bisimulation

48. Minimising Deterministic Büchi Automata Precisely Using SAT Solving

49. Deriving Syntax and Axioms for Quantitative Regular Behaviours

50. Compact Normal Form for Regular Languages as Xor Automata

Catalog

Books, media, physical & digital resources