Sciweavers

303 search results - page 51 / 61
» Automata on Gauss Words
Sort
View
90
Voted
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 15 days ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken
101
Voted
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 15 days ago
Does intelligence imply contradiction?
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
Patrizio Frosini
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 14 days ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
75
Voted
ENTCS
2006
99views more  ENTCS 2006»
15 years 12 days ago
Metrics for Action-labelled Quantitative Transition Systems
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun...
96
Voted
ENTCS
2006
141views more  ENTCS 2006»
15 years 12 days ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...