default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTudor Balanescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j8]Tudor Balanescu, Radu Nicolescu, Huiling Wu:
Asynchronous P Systems. Int. J. Nat. Comput. Res. 2(2): 1-18 (2011)
2000 – 2009
- 2005
- [j7]Florentin Ipate, Tudor Balanescu:
Refinement in Finite State Machine Testing. Fundam. Informaticae 64(1-4): 191-203 (2005) - 2002
- [j6]Joaquín Aguado, Tudor Balanescu, Anthony J. Cowling, Marian Gheorghe, Mike Holcombe, Florentin Ipate:
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines). Fundam. Informaticae 49(1-3): 17-33 (2002) - [c8]Tudor Balanescu, Marian Gheorghe, Mike Holcombe, Florentin Ipate:
Eilenberg P Systems. WMC-CdeA 2002: 43-57 - 2001
- [c7]Tudor Balanescu, Marian Gheorghe, Mike Holcombe:
Deterministic stream X-machines based on grammar systems. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 13-23 - [c6]Florentin Ipate, Marian Gheorghe, Mike Holcombe, Tudor Balanescu:
Testing Using X-Machine Translations. Words, Semigroups, and Transductions 2001: 211-229 - [c5]Tudor Balanescu, Marian Gheorghe
, Mike Holcombe, Florentin Ipate:
Testing Collaborative Agents Defined as Stream X-Machines with Distributed Grammars. ECAL 2001: 296-305 - 2000
- [j5]Tudor Balanescu:
Generalised Stream X-Machines with Output Delimited Type. Formal Aspects Comput. 12(6): 473-484 (2000) - [c4]Mike Holcombe, Tudor Balanescu, Marian Gheorghe, Paul Radovici-Marculescu:
On Testing Generalized Stream X-Machines. Recent Topics in Mathematical and Computational Linguistics 2000: 130-141
1990 – 1999
- 1999
- [j4]Tudor Balanescu, Anthony J. Cowling, Horia Georgescu, Marian Gheorghe, Mike Holcombe, Cristina Vertan:
Communicating Stream X-Machines Systems are no more than X-Machines. J. Univers. Comput. Sci. 5(9): 494-507 (1999) - [c3]Tudor Balanescu, Horia Georgescu, Marian Gheorghe:
A New Type of Counting Derivation for CD Grammar Systems. Grammatical Models of Multi-Agent Systems 1999: 1-17 - 1998
- [c2]Tudor Balanescu, Horia Georgescu, Marian Gheorghe:
Grammatical Models for Some Process Synchronizers. MFCS Workshop on Grammar Systems 1998: 117-137 - 1997
- [c1]Tudor Balanescu, Horia Georgescu, Marian Gheorghe:
Grammar Systems with Counting Derivation and Dynamical Priorities. New Trends in Formal Languages 1997: 150-166 - 1991
- [j3]Tudor Balanescu, Marian Gheorghe:
A note on PF(k) - parsable languages. Fundam. Informaticae 14(3): 283-286 (1991)
1980 – 1989
- 1986
- [j2]Tudor Balanescu:
On Hartmann's error-recovery scheme. ACM SIGPLAN Notices 21(12): 80-86 (1986) - 1984
- [j1]Tudor Balanescu:
A proof rule for the "it it" generalized control structure. Bull. EATCS 24: 48-52 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
