323 research outputs found

    On Bounded Linear Codes and the Commutative Equivalence

    Get PDF
    The problem of the commutative equivalence of semigroups generated by semi-linear languages is studied. In particular conditions ensuring that the Kleene closure of a bounded semi-linear code is commutatively equivalent to a regular language are investigated

    On the Commutative Equivalence of Algebraic Formal Series and Languages

    Get PDF
    The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated

    The 1991-1992 walking robot design

    Get PDF
    The University of Maryland Walking Machine team designed and constructed a robot. This robot was completed in two phases with supervision and suggestions from three professors and one graduate teaching assistant. Bob was designed during the Fall Semester 1991, then machined, assembled, and debugged in the Spring Semester 1992. The project required a total of 4,300 student hours and cost under $8,000. Mechanically, Bob was an exercise in optimization. The robot was designed to test several diverse aspects of robotic potential, including speed, agility, and stability, with simplicity and reliability holding equal importance. For speed and smooth walking motion, the footpath contained a long horizontal component; a vertical aspect was included to allow clearance of obstacles. These challenges were met with a leg design that utilized a unique multi-link mechanism which traveled a modified tear-drop footpath. The electrical requirements included motor, encoder, and voice control circuitry selection, manual controller manufacture, and creation of sensors for guidance. Further, there was also a need for selection of the computer, completion of a preliminary program, and testing of the robot

    Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Equivalence

    Get PDF
    It is shown that for every language family that is a trio containing only semilinear languages, all bounded languages in it can be accepted by one-way deterministic reversal-bounded multicounter machines (DCM). This implies that for every semilinear trio (where these properties are effective), it is possible to decide containment, equivalence, and disjointness concerning its bounded languages. A condition is also provided for when the bounded languages in a semilinear trio coincide exactly with those accepted by DCM machines, and it is used to show that many grammar systems of finite index — such as finite-index matrix grammars (Mfin) and finite-index ET0L (ET0Lfin) — have identical bounded languages as DCM. Then connections between ambiguity, counting regularity, and commutative regularity are made, as many machines and grammars that are unambiguous can only generate/accept counting regular or com- mutatively regular languages. Thus, such a system that can generate/accept a non-counting regular or non-commutatively regular language implies the existence of inherently ambiguous languages over that system. In addition, it is shown that every language generated by an unambiguous Mfin has a rational char- acteristic series in commutative variables, and is counting regular. This result plus the connections are used to demonstrate that the grammar systems Mfin and ET0Lfin can generate inherently ambiguous languages (over their grammars), as do several machine models. It is also shown that all bounded languages generated by these two grammar systems (those in any semilinear trio) can be generated unambiguously within the systems. Finally, conditions on Mfin and ET0Lfin languages implying commutative regularity are obtained. In particular, it is shown that every finite-index ED0L language is commutatively regular

    Nuclear Power - Control, Reliability and Human Factors

    Get PDF
    Advances in reactor designs, materials and human-machine interfaces guarantee safety and reliability of emerging reactor technologies, eliminating possibilities for high-consequence human errors as those which have occurred in the past. New instrumentation and control technologies based in digital systems, novel sensors and measurement approaches facilitate safety, reliability and economic competitiveness of nuclear power options. Autonomous operation scenarios are becoming increasingly popular to consider for small modular systems. This book belongs to a series of books on nuclear power published by InTech. It consists of four major sections and contains twenty-one chapters on topics from key subject areas pertinent to instrumentation and control, operation reliability, system aging and human-machine interfaces. The book targets a broad potential readership group - students, researchers and specialists in the field - who are interested in learning about nuclear power
    • …
    corecore